131 search results - page 1 / 27 » Scalable Clustering for Large High-Dimensional Data Based on... |
CIDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
ICDM
2002
IEEE
13 years 9 months ago
2002
IEEE
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
SDM
2009
SIAM
14 years 1 months ago
2009
SIAM
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
SIGMOD
1998
ACM
13 years 8 months ago
1998
ACM
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...
ICDE
2003
IEEE
14 years 5 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...