A Note On Spectral Clustering

DOI10.4230/LIPIcs.ESA.2016.57zbMath1397.68144OpenAlexW2101866190MaRDI QIDQ4606329

Kurt Mehlhorn, Pavel Kolev

Publication date: 2 March 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2016.57

zbMATH Keywords

power method\(k\)-means clusteringspectral embeddinggap assumption

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (6)

Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ Partitioning Well-Clustered Graphs: Spectral Clustering Works! ⋮ Bipartite communities via spectral partitioning ⋮ Convex programming based spectral clustering ⋮ Social pressure in opinion dynamics

This page was built for publication: A Note On Spectral Clustering