Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first solve an eigenvalue decomposition problem to get the low-dimensional embedding of the data points, and then apply some heuristic methods such as k-means to get the desired clusters. However, eigenvalue decomposition is very time-consuming, making the overall complexity of spectral clustering very high, and thus preventing spectral clustering from being widely applied in large-scale problems. To tackle this problem, different from traditional algorithms, we propose a very fast and scalable spectral clustering algorithm called the sequential matrix compression (SMC) method. In this algorithm, we scale down the computational complexity of spectral clustering by sequentially reducing the dimension of the Laplacian matrix in the iteration steps with very little loss of accuracy. Experiments showed the feasibility and efficiency of the proposed algorithm.
KeywordsIteration Step Spectral Cluster Stable Point Laplacian Matrix Spectral Cluster Algorithm
- 1.Baeza-Yates, R., Ribeiro-Neto, B.: Modern information retrieval. In: ACM Press, a Division of the Association for Computing Machinery, Inc. ACM Press, New York (1999)Google Scholar
- 2.Golub, G.H., Loan, C.F.V.: Matrix computations, 3rd edn. Johns Hopking University Press (1996)Google Scholar
- 3.Hagen, L., Kahng, A.B.: New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on CAD 11, 1074–1085 (1992)Google Scholar
- 5.Lang, K.: News Weeder: Learning to filter netnews. In: ICML 1995, pp. 331–339 (1995)Google Scholar
- 7.Sorensen, D.C.: Implicitly-restarted Arnoldi/Lanczos methods for large scale eigenvalue calculations. Technical Report TR-96-40 (1996)Google Scholar