.png){kind=icon}
Return
ROBUST SUBSPACE CLUSTERING
.png){kind=icon}
OA
AI
DOI：10.1214/13-AOS1199.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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:
Subspace clustering
spectral clustering
LASSO
Dantzig selector
l(1) minimization
multiple hypothesis testing
true and false discoveries
geometric functional analysis
nonasymptotic random matrix theory
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.7
Papers:
2.8K
Citations:
2.9W
Organization
View more organizations
Cited Papers
ShareSaveShareSaveShareSaveShareSaveGenetic association study of the GNB3 C825T, the ACE I/D and the eNOS G894T polymorphisms and the risk to develop erectile dysfunction in a German ED population.png)
AndrologiaOAAI
AndrologiaIF0
OAAIShareSave
View more