7 citations · 10 across the 2 of their papers we have counts for
2 papers
stat.ML2011★ 7 cited
How the result of graph clustering methods depends on the construction of the graph
Markus Maier, Ulrike von Luxburg, Matthias Hein
We study the scenario of graph-based clustering algorithms such as spectral clustering. Given a set of data points, one first has to construct a graph on the data points and then a…
math.ST2006★ 3 cited
Graph Laplacians and their convergence on random neighborhood graphs
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxburg
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subma…