ABSTRACT
Spectral clustering is one of the most prominent clustering approaches. However, it is highly sensitive to noisy input data. In this work, we propose a robust spectral clustering technique able to handle such scenarios. To achieve this goal, we propose a sparse and latent decomposition of the similarity graph used in spectral clustering. In our model, we jointly learn the spectral embedding as well as the corrupted data - thus, enhancing the clustering performance overall. We propose algorithmic solutions to all three established variants of spectral clustering, each showing linear complexity in the number of edges. Our experimental analysis confirms the significant potential of our approach for robust spectral clustering. Supplementary material is available at www.kdd.in.tum.de/RSC.
- C. C. Aggarwal and C. K. Reddy. Data clustering: algorithms and applications. CRC Press, 2013.Google ScholarCross Ref
- E. J. Candès, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? JACM, 58(3):11, 2011. Google ScholarDigital Library
- H. Chang and D.-Y. Yeung. Robust path-based spectral clustering. Pattern Recognition, 41(1):191--203, 2008. Google ScholarDigital Library
- A. Condon and R. M. Karp. Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms, 18(2):116--140, 2001. Google ScholarDigital Library
- C. Davis and W. M. Kahan. The rotation of eigenvectors by a perturbation. iii. SIAM SINUM, 7(1):1--46, 1970. Google ScholarDigital Library
- N. Günnemann, S. Günnemann, and C. Faloutsos. Robust multivariate autoregression for anomaly detection in dynamic product ratings. In WWW, pages 361--372, 2014. Google ScholarDigital Library
- S. Günnemann, I. Farber, S. Raubach, and T. Seidl. Spectral subspace clustering for graphs with feature vectors. In ICDM, pages 231--240, 2013. Google ScholarCross Ref
- S. Günnemann, N. Günnemann, and C. Faloutsos. Detecting anomalies in dynamic rating data. In KDD, pages 841--850, 2014. Google ScholarDigital Library
- H. Huang, S. Yoo, H. Qin, and D. Yu. A robust clustering algorithm based on aggregated heat kernel mapping. In ICDM, pages 270--279, 2011. Google ScholarDigital Library
- F. Jordan and F. Bach. Learning spectral clustering. Adv. Neural Inf. Process. Syst, 16:305--312, 2004.Google Scholar
- W. Kong, S. Hu, J. Zhang, and G. Dai. Robust and smart spectral clustering from normalized cut. Neural Computing and Applications, 23(5):1503--1512, 2013. Google ScholarCross Ref
- D. Lehmann, L. I. Oćallaghan, and Y. Shoham. Truth revelation in approximately efficient combinatorial auctions. Journal of the ACM, 49(5):577--602, 2002. Google ScholarDigital Library
- X. Li, W. Hu, C. Shen, A. Dick, and Z. Zhang. Context-aware hypergraph construction for robust spectral clustering. TKDE, 26(10):2588--2597, 2014. Google ScholarCross Ref
- Z. Li, J. Liu, S. Chen, and X. Tang. Noise robust spectral clustering. In ICCV, pages 1--8, 2007. Google ScholarCross Ref
- B. A. Miller, M. S. Beard, P. J. Wolfe, and N. T. Bliss. A spectral framework for anomalous subgraph detection. Trans. on Signal Proc., 63(16):4191--4206, 2015. Google ScholarDigital Library
- J. Pfeiffer and F. Rothlauf. Analysis of greedy heuristics and weight-coded eas for multidimensional knapsack problems and multi-unit combinatorial auctions. In GECCO, pages 1529--1529, 2007. Google ScholarDigital Library
- P. J. Rousseeuw. Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. Computational and applied mathematics, 20:53--65, 1987. Google ScholarDigital Library
- P. J. Rousseeuw and A. M. Leroy. Robust regression and outlier detection, volume 589. John Wiley, 2005.Google Scholar
- G. Stewart and J.-G. Sun. Matrix Perturbation Theory. Academic Press Boston, 1990.Google Scholar
- U. von Luxburg. A tutorial on spectral clustering. Statistics and Computing, 17(4):395--416, 2007. Google ScholarDigital Library
- X. Wang, F. Nie, and H. Huang. Structured doubly stochastic matrix for graph based clustering. In KDD, pages 1245--1254, 2016. Google ScholarDigital Library
- L. Wu, X. Ying, X. Wu, and Z. Zhou. Line orthogonality in adjacency eigenspace with application to community partition. In IJCAI, pages 2349--2354, 2011.Google Scholar
- L. Zelnik-Manor and P. Perona. Self-tuning spectral clustering. In NIPS, pages 1601--1608, 2004.Google ScholarDigital Library
- X. Zhu, C. Loy, and S. Gong. Constructing robust affinity graphs for spectral clustering. In CVPR, pages 1450--1457, 2014. Google ScholarDigital Library
Index Terms
- Robust Spectral Clustering for Noisy Data: Modeling Sparse Corruptions Improves Latent Embeddings
Recommendations
Robust path-based spectral clustering
Spectral clustering and path-based clustering are two recently developed clustering approaches that have delivered impressive results in a number of challenging clustering tasks. However, they are not robust enough against noise and outliers in the ...
Spectral clustering with robust self-learning constraints
AbstractSpectral clustering is a leading unsupervised classification algorithm widely used to capture complex clusters in unlabeled data. Additional prior information can further enhance the quality of spectral clustering results to satisfy ...
Robust convex clustering
AbstractObjective-based clustering is a class of important clustering analysis techniques; however, these methods are easily beset by local minima due to the non-convexity of their objective functions involved, as a result, impacting final clustering ...
Comments