190 search results - page 10 / 38 » Constraint-Based Subspace Clustering. |
SIGMOD
2000
ACM
14 years 2 days ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
IEEEVAST
2010
13 years 2 months ago
2010
Data sets in astronomy are growing to enormous sizes. Modern astronomical surveys provide not only image data but also catalogues of millions of objects (stars, galaxies), each ob...
CVPR
2009
IEEE
15 years 2 months 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 ...
ICCV
2009
IEEE
15 years 21 days ago
2009
IEEE
This paper studies automatic segmentation of multiple
motions from tracked feature points through spectral embedding
and clustering of linear subspaces. We show that
the dimensi...
ICDE
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subs...