# On Consistency of Compressive Spectral Clustering

12 Feb 2017

Spectral clustering is one of the most popular methods for community detection in graphs. A key step in spectral clustering algorithms is the eigen decomposition of the $n{\times}n$ graph Laplacian matrix to extract its $k$ leading eigenvectors, where $k$ is the desired number of clusters among $n$ objects... (read more)

PDF Abstract

# Code Add Remove Mark official

No code implementations yet. Submit your code now