149 search results - page 1 / 30 » BIRCH: An Efficient Data Clustering Method for Very Large Da... |
SIGMOD
1996
ACM
13 years 9 months ago
1996
ACM
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
SIGMOD
2001
ACM
14 years 5 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
VLDB
1998
ACM
13 years 9 months ago
1998
ACM
Many applications require the management of spatial data. Clustering large spatial databases is an important problem which tries to find the densely populated regions in the featu...
IDEAS
2006
IEEE
13 years 11 months ago
2006
IEEE
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyc...
KDD
2000
ACM
13 years 8 months ago
2000
ACM
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...