• Corpus ID: 237213326

Clustering dynamics on graphs: from spectral clustering to mean shift through Fokker-Planck interpolation

@article{Craig2021ClusteringDO,
  title={Clustering dynamics on graphs: from spectral clustering to mean shift through Fokker-Planck interpolation},
  author={Katy Craig and Nicol{\'a}s Garc{\'i}a Trillos and Dejan Slep{\vc}ev},
  journal={ArXiv},
  year={2021},
  volume={abs/2108.08687}
}
A BSTRACT . In this work we build a unifying framework to interpolate between density-driven and geometry-based algorithms for data clustering, and specifically, to connect the mean shift algorithm with spectral clustering at discrete and continuum levels. We seek this connection through the introduction of Fokker-Planck equations on data graphs. Besides introducing new forms of mean shift algorithms on graphs, we provide new theoretical insights on the behavior of the family of diffusion maps… 

On a Class of Nonlocal Continuity Equations on Graphs

. Motivated by applications in data science, we study partial differential equations on graphs. By a classical fixed-point argument, we show existence and uniqueness of solutions to a class of nonlocal

References

SHOWING 1-10 OF 54 REFERENCES

A variational approach to the consistency of spectral clustering

Path-Based Spectral Clustering: Guarantees, Robustness to Outliers, and Fast Algorithms

This work provides conditions under which the Laplacian eigengap statistic correctly determines the number of clusters for a large class of data sets, and proves finite-sample guarantees on the performance of clustering with respect to this metric when random samples are drawn from multiple intrinsically low-dimensional clusters in high-dimensional space.

Geometric structure of graph Laplacian embeddings

A notion of a well-separated mixture model which only depends on the model itself is introduced, and it is proved that when the model is well separated, with high probability the embedded data set concentrates on cones that are centered around orthogonal vectors.

A tutorial on spectral clustering

This tutorial describes different graph Laplacians and their basic properties, present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches.

Balancing Geometry and Density: Path Distances on High-Dimensional Data

New geometric and computational analyses of power-weighted shortest-path distances (PWSPDs) are presented. By illuminating the way these metrics balance density and geometry in the underlying data,

Improved spectral convergence rates for graph Laplacians on epsilon-graphs and k-NN graphs

The results show that the eigenvalues and eigenvectors of the graph Laplacian converge to those of the Laplace-Beltrami operator at a rate of $O(n^{-1/(m+4)})$, up to log factors, where m is the manifold dimension and $n$ is the number of vertices in the graph.

Consistency of spectral clustering

It is proved that one of the two major classes of spectral clustering (normalized clustering) converges under very general conditions, while the other is only consistent under strong additional assumptions, which are not always satisfied in real data.

Diffusion maps

The geometry of kernelized spectral clustering

This work studies the performance of spectral clustering in recovering the latent labels of i.i.d. samples from a finite mixture of nonparametric distributions and controls the fraction of samples mislabeled under finite mixtures with non Parametric components.
...