29 citations · 46 across the 6 of their papers we have counts for
3 papers · 1 filter
Clustering dynamics on graphs: from spectral clustering to mean shift through Fokker-Planck interpolation
Katy Craig, Nicolás García Trillos, Dejan Slepčev
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 algo…
Large Data and Zero Noise Limits of Graph-Based Semi-Supervised Learning Algorithms
Matthew M. Dunlop, Dejan Slepčev, Andrew M. Stuart +1
Scalings in which the graph Laplacian approaches a differential operator in the large graph limit are used to develop understanding of a number of algorithms for semi-supervised le…
Error estimates for spectral convergence of the graph Laplacian on random geometric graphs towards the Laplace--Beltrami operator
Nicolas Garcia Trillos, Moritz Gerlach, Matthias Hein +1
We study the convergence of the graph Laplacian of a random geometric graph generated by an i.i.d. sample from a -dimensional submanifold in as the sample size inc…