502 search results - page 16 / 101 » Sparse Subspace Clustering |
124
Voted
ICML
2010
IEEE
15 years 11 days ago
2010
IEEE
Many clustering algorithms only find one clustering solution. However, data can often be grouped and interpreted in many different ways. This is particularly true in the high-dim...
141
click to vote
SIGMOD
2000
ACM
15 years 6 months 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...
126
click to vote
IEEEVAST
2010
14 years 8 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...
121
click to vote
ICCV
2009
IEEE
16 years 6 months 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...
101
click to vote
ICDE
2005
IEEE
15 years 7 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...