80 search results - page 1 / 16 » O-Cluster: Scalable Clustering of Large High Dimensional Dat... |
ICDM
2002
IEEE
15 years 2 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...
CIDM
2007
IEEE
15 years 3 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...
KDD
2001
ACM
15 years 9 months ago
2001
ACM
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
87
Voted
SIGMOD
1998
ACM
15 years 1 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...
108
click to vote
ICPP
2000
IEEE
15 years 1 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...