Name
Abstract | ||
|---|---|---|
Algebraic Subspace Clustering (ASC) is a simple and elegant method based on polynomial fitting and differentiation for clustering noiseless data drawn from an arbitrary union of subspaces. In practice, however, ASC is limited to equi-dimensional subspaces because the estimation of the subspace dimension via algebraic methods is sensitive to noise. This paper proposes a new ASC algorithm that can handle noisy data drawn from subspaces of arbitrary dimensions. The key ideas are (1) to construct, at each point, a decreasing sequence of subspaces containing the subspace passing through that point; (2) to use the distances from any other point to each subspace in the sequence to construct a subspace clustering affinity, which is superior to alternative affinities both in theory and in practice. Experiments on the Hopkins 155 dataset demonstrate the superiority of the proposed method with respect to sparse and low rank subspace clustering methods. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ICCVW.2015.116 | 2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION WORKSHOP (ICCVW) |
Field | DocType | Volume |
CURE data clustering algorithm,Clustering high-dimensional data,Pattern recognition,Correlation clustering,Subspace topology,Random subspace method,Computer science,SUBCLU,Linear subspace,Artificial intelligence,Cluster analysis | Journal | abs/1510.04396 |
Issue | Citations | PageRank |
1 | 5 | 0.41 |
References | Authors | |
17 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manolis C. Tsakiris | 1 | 50 | 9.79 |
| rene victor valqui vidal | 2 | 5331 | 260.14 |