How the result of graph clustering methods depends on the construction of the graph

DOI10.1051/PS/2012001MaRDI QIDQ5408477zbMATH OpenOpenAlexFDO

Authors Markus Maier, Ulrike Von Luxburg, Matthias Hein

Publication date 10 April 2014

Published in ESAIM: Probability and Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ps/2012001

zbMATH Keywords

random geometric graphsgraph cuts

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Learning Theory
• Consistency of spectral clustering
• A variational approach to the consistency of spectral clustering
• Consistency of Cheeger and ratio graph cuts
• Higher-order spectral clustering for geometric graphs

Cited in

(7)

• Continuum limit of total variation on point clouds
• Consistency of modularity clustering on random geometric graphs
• Randomized near-neighbor graphs, giant components and applications in data science
• scientific article; zbMATH DE number 7371757 (Why is no real title available?)
• Theoretical Analysis of Active Contours on Graphs
• Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
• Adaptive edge weighting for graph-based learning algorithms

This page was built for publication: How the result of graph clustering methods depends on the construction of the graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408477)