502 search results - page 1 / 101 » Sparse Subspace Clustering |
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
CVPR
2009
IEEE
15 years 17 days ago
2009
IEEE
We propose a method based on sparse representation
(SR) to cluster data drawn from multiple low-dimensional
linear or affine subspaces embedded in a high-dimensional
space. Our ...
SDM
2008
SIAM
13 years 6 months ago
2008
SIAM
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
SADM
2008
13 years 5 months ago
2008
: In this article, we propose an efficient and effective method for finding arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set o...
SDM
2004
SIAM
13 years 6 months ago
2004
SIAM
Several application domains such as molecular biology and geography produce a tremendous amount of data which can no longer be managed without the help of efficient and effective ...