436 search results - page 3 / 88 » Automatic Subspace Clustering of High Dimensional Data for D... |
SDM
2009
SIAM
14 years 2 months ago
2009
SIAM
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
ICDM
2002
IEEE
13 years 9 months ago
2002
IEEE
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
PAKDD
2009
ACM
13 years 11 months ago
2009
ACM
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...
CVPR
2004
IEEE
14 years 6 months ago
2004
IEEE
Multibody grouping is a representative of applying subspace constraints in computer vision tasks. Under linear projection models, feature points of multibody reside in multiple su...