Clustering dynamics on graphs: from spectral clustering to mean shift through Fokker-Planck interpolation
From MaRDI portal
Publication:6375591
DOI10.1007/978-3-030-93302-9_4arXiv2108.08687MaRDI QIDQ6375591FDOQ6375591
Authors: Katy Craig, Nicolás García Trillos, Dejan Slepčev 
Publication date: 17 August 2021
Abstract: 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.
Graph theory (05Cxx) Numerical methods for partial differential equations, boundary value problems (65Nxx) Numerical methods for partial differential equations, initial value and time-dependent initial-boundary value problems (65Mxx)
This page was built for publication: Clustering dynamics on graphs: from spectral clustering to mean shift through Fokker-Planck interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6375591)
