Robust subspace clustering
Authors:
- Mahdi SoltanolkotabiMSMahdi Soltanolkotabi
- Ehsan ElhamifarEEEhsan Elhamifar
- Emmanuel J. CandèsECEmmanuel J. Candès
Top Cited Papers
Open Access
- 1 April 2014
- journal article
- research article
- Published by Institute of Mathematical Statistics in The Annals of Statistics
- Vol. 42 (2) , 669-699
Abstract
Subspace clustering refers to the task of finding a multi-subspace representation that best fits a collection of points taken from a high-dimensional space. This paper introduces an algorithm inspired by sparse subspace clustering (SSC) [In IEEE Conference on Computer Vision and Pattern Recognition, CVPR (2009) 2790–2797] to cluster noisy data, and develops some novel theory demonstrating its correctness. In particular, the theory uses ideas from geometric functional analysis to show that the algorithm can accurately recover the underlying subspaces under minimal requirements on their orientation, and on the number of samples per subspace. Synthetic as well as real data experiments complement our theoretical study, illustrating our approach and demonstrating its effectiveness.Keywords
All Related Versions
This publication has 52 references indexed in Scilit:
- High-Dimensional Regression with Unknown VarianceStatistical Science, 2012
- A geometric analysis of subspace clustering with outliersThe Annals of Statistics, 2012
- Square-root lasso: pivotal recovery of sparse signals via conic programmingBiometrika, 2011
- Identification of switched linear systems via sparse optimizationAutomatica, 2011
- Sparse recovery under matrix uncertaintyThe Annals of Statistics, 2010
- Spectral AlgorithmsFoundations and Trends® in Theoretical Computer Science, 2009
- Foundations of a Multi-way Spectral Clustering Framework for Hybrid Linear ModelingFoundations of Computational Mathematics, 2009
- The Dantzig selector: Statistical estimation when p is much larger than nThe Annals of Statistics, 2007
- High-dimensional graphs and variable selection with the LassoThe Annals of Statistics, 2006
- Subspace clustering for high dimensional dataACM SIGKDD Explorations Newsletter, 2004