Spectral Sparse Representation for Clustering: Evolved from PCA, K-means, Laplacian Eigenmap, and Ratio Cut

Explore this paper's citation graph

Summary

It is found that the spectral graph theory underlies a series of elementary methods and can unify them into a complete framework, called spectral sparse representation (SSR), and Scut, a clustering approach derived from SSR reaches the state-of-the-art performance in the spectral clustering family.

Type
preprint
Published
2014-03-25
Cited by
3
References
96
Access
Open access

Keywords

Pattern recognition (psychology), Cluster analysis, Spectral clustering, Representation (politics), Laplace operator

References

Cited by

Related papers