502 search results - page 13 / 101 » Sparse Subspace Clustering |
120
Voted
ICDM
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper, we propose a semi-supervised framework for learning a weighted Euclidean subspace, where the best clustering can be achieved. Our approach capitalizes on user-const...
111
click to vote
KDD
2004
ACM
16 years 2 months ago
2004
ACM
Traditional clustering is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. While domain knowledge is always the bes...
158
Voted
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
107
click to vote
SIGIR
2004
ACM
15 years 7 months ago
2004
ACM
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
68
Voted
AUSAI
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present a novel algorithm called DBSC, which finds subspace clusters in numerical datasets based on the concept of ”dependency”. This algorithm employs a depth-...