How to Round Subspaces: A New Spectral Clustering Algorithm

DOI10.1137/1.9781611974331.ch128zbMath1412.62086arXiv1503.00827OpenAlexW1842953391MaRDI QIDQ4575712

Ali Kemal Sinop

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.00827

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Spectral concentration and greedy \(k\)-clustering ⋮ Convex programming based spectral clustering

This page was built for publication: How to Round Subspaces: A New Spectral Clustering Algorithm