Clustering Dynamics on Graphs: From Spectral Clustering to Mean Shift Through Fokker–Planck Interpolation

DOI10.1007/978-3-030-93302-9_4MaRDI QIDQ5054577zbMATH OpenOpenAlexFDO

Authors Katy Craig, Nicolás García Trillos, Dejan Slepčev

Publication date 29 November 2022

Published in Active Particles, Volume 3 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2108.08687

Mathematics Subject Classification ID

Graph theory (05Cxx) Numerical analysis (65-XX)

Recommendations

• Mean shift spectral clustering
• Clustering methods based on kernel density estimators: mean shift algorithms
• Learning by unsupervised nonlinear diffusion
• A variational approach to the consistency of spectral clustering
• Convergence and stability analysis of mean-shift algorithm on large data sets

Cites work

• A graph discretization of the Laplace-Beltrami operator
• A Graph-Theoretic Approach to Nonparametric Cluster Analysis
• A survey of outlier detection methodologies
• A variational approach to the consistency of spectral clustering
• About small eigenvalues of the Witten Laplacian
• Balancing geometry and density: path distances on high-dimensional data
• Clustering methods based on kernel density estimators: mean shift algorithms
• Consistency of spectral clustering
• Convergence of graph Laplacian with kNN self-tuned kernels
• Diffusion maps
• Diffusion maps, spectral clustering and reaction coordinates of dynamical systems
• Empirical graph Laplacian approximation of Laplace–Beltrami operators: Large sample results
• Entropy dissipation semi-discretization schemes for Fokker-Planck equations
• Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
• Estimating the number of clusters in a data set via the gap statistic
• From graph to manifold Laplacian: the convergence rate
• Gradient flows in metric spaces and in the space of probability measures
• Gradient flows of the entropy for finite Markov chains
• Graph Laplacians and their convergence on random neighborhood graphs
• scientific article; zbMATH DE number 7255037 (Why is no real title available?)
• scientific article; zbMATH DE number 7370580 (Why is no real title available?)
• Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Learning Theory
• Learning Theory
• Lipschitz regularity of graph Laplacians on random data clouds
• Nonlocal-interaction equation on graphs: gradient flow structure and continuum limit
• On the estimation of the gradient lines of a density and the consistency of the mean-shift algorithm
• Scikit
• Scikit-learn: machine learning in Python
• Spectral Convergence of Diffusion Maps: Improved Error Bounds and an Alternative Normalization
• Spectral convergence of graph Laplacian and heat kernel reconstruction in L^ from random samples
• Supersymmetry and Morse theory
• The estimation of the gradient of a density function, with applications in pattern recognition
• The geometry of kernelized spectral clustering

Cited in

(6)

• scientific article; zbMATH DE number 6781370 (Why is no real title available?)
• Clustering dynamics on graphs: from spectral clustering to mean shift through Fokker-Planck interpolation
• On evolution PDEs on co-evolving graphs
• On a class of nonlocal continuity equations on graphs
• Evolution equations on co-evolving graphs: long-time behaviour and the graph-continuity equation
• Graph-to-local limit for the nonlocal interaction equation

Describes a project that uses

Uses Software

• Scikit
• SciPy
• Matplotlib
• NumPy

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 Q5054577)