Metadata only
Date
2013Type
- Conference Paper
ETH Bibliography
yes
Altmetrics
Abstract
We consider the problem of clustering noisy high-dimensional data points into a union of low-dimensional subspaces and a set of outliers. The number of subspaces, their dimensions, and their orientations are unknown. A probabilistic performance analysis of the thresholding-based subspace clustering (TSC) algorithm introduced recently in [1] shows that TSC succeeds in the noisy case, even when the subspaces intersect. Our results reveal an explicit tradeoff between the allowed noise level and the affinity of the subspaces. We furthermore find that the simple outlier detection scheme introduced in [1] provably succeeds in the noisy case. Show more
Publication status
publishedExternal links
Book title
2013 IEEE International Symposium on Information TheoryPages / Article No.
Publisher
IEEEEvent
Organisational unit
03610 - Boelcskei, Helmut / Boelcskei, Helmut
More
Show all metadata
ETH Bibliography
yes
Altmetrics