most citedHow the result of graph clustering methods depends on the construction of the graph

7 citations · 10 across the 2 of their papers we have counts for

collaborators
Showing math.STShow all

1 paper · 1 filter

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…