Noisy subspace clustering via thresholding
METADATA ONLY
Loading...
Author / Producer
Date
2013
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
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.
Permanent link
Publication status
published
External links
Editor
Book title
2013 IEEE International Symposium on Information Theory
Journal / series
Volume
Pages / Article No.
1382 - 1386
Publisher
IEEE
Event
2013 IEEE International Symposium on Information Theory (ISIT 2013)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
03610 - Boelcskei, Helmut / Boelcskei, Helmut