110 citations · 152 across the 4 of their papers we have counts for
Showing stat.MLShow all
2 papers · 1 filter
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…
stat.ML2009★ 110 cited
Optimal construction of k-nearest neighbor graphs for identifying noisy clusters
Markus Maier, Matthias Hein, Ulrike von Luxburg
We study clustering algorithms based on neighborhood graphs on a random sample of data points. The question we ask is how such a graph should be constructed in order to obtain opti…