paper
referenced-only
2013
paper:doi-10-1214-13-aos1199

Robust Subspace Clustering

ByM. Soltanolkotabi·Ehsan Elhamifar·E. Candès
Original abstract (expand)

Subspace clustering refers to the task of nding a multi-subspace representation that best ts a collection of points taken from a high-dimensional space. This paper introduces an algorithm inspired by sparse subspace clustering (SSC) (25) 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 eectiveness.

Similar preprints — Semantic Scholar

Cited by (2)