Log In Sign Up

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

by   Katy Craig, et al.

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 in the large sample limit as well as provide new connections between diffusion maps and mean shift dynamics on a fixed graph. Several numerical examples illustrate our theoretical findings and highlight the benefits of interpolating density-driven and geometry-based clustering algorithms.


page 13

page 33

page 34

page 35

page 36

page 37

page 38


A review of mean-shift algorithms for clustering

A natural way to characterize the cluster structure of a dataset is by f...

An Algorithmic Introduction to Clustering

This paper tries to present a more unified view of clustering, by identi...

Multimodal diffusion geometry by joint diagonalization of Laplacians

We construct an extension of diffusion geometry to multiple modalities t...

Making Laplacians commute

In this paper, we construct multimodal spectral geometry by finding a pa...

Tropical Modeling of Weighted Transducer Algorithms on Graphs

Weighted Finite State Transducers (WFSTs) are versatile data structures ...

Data spectroscopy: Eigenspaces of convolution operators and clustering

This paper focuses on obtaining clustering information about a distribut...

EigenGame Unloaded: When playing games is better than optimizing

We build on the recently proposed EigenGame that views eigendecompositio...