766 search results - page 11 / 154 » Clustering high dimensional data using subspace and projecte... |
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
Clustering of large data bases is an important research area with a large variety of applications in the data base context. Missing in most of the research efforts are means for g...
PAKDD
2010
ACM
13 years 10 months ago
2010
ACM
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
Projected clustering has become a hot research topic due to its ability to cluster high-dimensional data. However, most existing projected clustering algorithms depend on some cri...
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
