How the result of graph clustering methods dependson the construction of the graph
M Maier, U Von Luxburg, M Hein - ESAIM: Probability and Statistics, 2013 - cambridge.org
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
apply a graph clustering algorithm to find a suitable partition of the graph. Our main question
is if and how the construction of the graph (choice of the graph, choice of parameters, choice
of weights) influences the outcome of the final clustering result. To this end we study the
convergence of cluster quality measures such as the normalized cut or the Cheeger cut on …
Given a set of data points, one first has to construct a graph on the data points and then
apply a graph clustering algorithm to find a suitable partition of the graph. Our main question
is if and how the construction of the graph (choice of the graph, choice of parameters, choice
of weights) influences the outcome of the final clustering result. To this end we study the
convergence of cluster quality measures such as the normalized cut or the Cheeger cut on …
[CITATION][C] How the result of graph clustering methods depends on the construction of the graph. e-prints
M Maier, U von Luxburg, M Hein - arXiv preprint arXiv:1102.2075, 2011
Showing the best results for this search. See all results