DBScholar

Back to papers

CURE: An Efficient Clustering Algorithm for Large Databases

Summary: CURE: robust to outliers, it discovers non-spherical, variably sized clusters using multiple dispersed points per cluster shrunk toward the center. Scales to large data via sampling and partitioning with a two-pass refinement, outperforming prior methods. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3065
Venue
SIGMOD
Year
1998
Pagerank
0.00020424271
Overall Rank
351 | 97.60%
DOI
10.1145/276304.276312

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{guha_sigmod98,
        title = {{CURE: An Efficient Clustering Algorithm for Large Databases}},
        author = {Guha, Sudipto and Rastogi, Rajeev and Shim, Kyuseok},
        series = {{SIGMOD} '98},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/276304.276312},
        url = {https://dl.acm.org/doi/10.1145/276304.276312},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 34 of 34 citing papers.

Rank Citing Paper Year Venue Pagerank
291 OPTICS: Ordering Points To Identify the Clustering Structure 1999 SIGMOD 0.00022264197
578 Efficient Algorithms for Mining Outliers from Large Data Sets 2000 SIGMOD 0.00016221871
907 A Framework for Clustering Evolving Data Streams 2003 VLDB 0.00013309819
1,053 Multi-dimensional Selectivity Estimation Using Compressed Histogram Information 1999 SIGMOD 0.00012401532
1,602 Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces 2000 VLDB 0.00010239526
1,646 Fast Algorithms for Projected Clustering 1999 SIGMOD 0.00010128564
1,721 Semantic Compression and Pattern Extraction with Fascicles 1999 VLDB 9.9258415e-05
1,935 ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search 2011 SIGMOD 9.4560124e-05
1,993 Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data 2001 SIGMOD 9.3421788e-05
2,085 Scalable K-Means++ 2012 VLDB 9.1943614e-05
2,218 Maintaining Variance and k–Medians over Data Stream Windows 2003 PODS 8.9331834e-05
2,253 Approximation Algorithms for Clustering Uncertain Data 2008 PODS 8.8664016e-05
2,699 Approximate XML Joins 2002 SIGMOD 8.2433011e-05
2,979 Indexing the Distance: An Efficient Method to KNN Processing 2001 VLDB 7.8984588e-05
3,371 Modeling and Querying Possible Repairs in Duplicate Detection 2009 VLDB 7.4697134e-05
3,550 A Monte Carlo Algorithm for Fast Projective Clustering 2002 SIGMOD 7.3200789e-05
3,881 Using Trees to Depict a Forest 2009 VLDB 7.0490549e-05
4,151 YADING: Fast Clustering of Large-Scale Time Series Data 2015 VLDB 6.8703273e-05
4,209 Outlier Detection for High Dimensional Data 2001 SIGMOD 6.8319192e-05
4,222 Density Biased Sampling: An Improved Method for Data Mining and Clustering 2000 SIGMOD 6.8227421e-05
4,651 Density-based Place Clustering in Geo-Social Networks 2014 SIGMOD 6.585234e-05
4,689 LinkClus: Efficient Clustering via Heterogeneous Semantic Links 2006 VLDB 6.5614634e-05
6,956 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.7303405e-05
7,023 C2P: Clustering based on Closest Pairs 2001 VLDB 5.7242118e-05
7,210 A Framework for Measuring Changes in Data Characteristics 1999 PODS 5.6720634e-05
7,602 Clustering Objects on a Spatial Network 2004 SIGMOD 5.5866563e-05
9,271 MAIDS: Mining Alarming Incidents from Data Streams 2004 SIGMOD 5.2945481e-05
9,272 A Framework for Projected Clustering of High Dimensional Data Streams 2004 VLDB 5.2945481e-05
9,575 Local Search Methods for k-Means with Outliers 2017 VLDB 5.2528121e-05
9,952 Distance-Based Outlier Detection: Consolidation and Renewed Bearing 2010 VLDB 5.191171e-05
11,143 k-Clustering with Comparison and Distance Oracles 2024 PODS 5.093636e-05
12,764 k-Means Projective Clustering 2004 PODS 5.093636e-05
12,815 A Shrinking-Based Approach for Multi-Dimensional Data Analysis 2003 VLDB 5.093636e-05
12,880 Data Mining on an OLTP System (Nearly) for Free 2000 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.001157935
31 BIRCH: An Efficient Data Clustering Method for Very Large Databases 1996 SIGMOD 0.00050347119
42 The R+-Tree: A Dynamic Multi-Dimensional Index for Objects 1987 VLDB 0.00046170812
88 Efficient and Effective Clustering Methods for Spatial Data Mining 1994 VLDB 0.00035240327
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 578 Efficient Algorithms for Mining Outliers from Large Data Sets 2000 SIGMOD
2 2,253 Approximation Algorithms for Clustering Uncertain Data 2008 PODS
3 516 Data Curation at Scale: The Data Tamer System 2013 CIDR
4 304 Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications 1998 SIGMOD
5 3,663 Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering 1999 VLDB
6 4,856 Computing Clusters of Correlation Connected Objects 2004 SIGMOD
7 1,646 Fast Algorithms for Projected Clustering 1999 SIGMOD
8 6,658 CURE for Cubes: Cubing Using a ROLAP Engine 2006 VLDB
9 10,065 On Saving Outliers for Better Clustering over Noisy Data 2021 SIGMOD
10 14,127 Clustering Methods for Large Databases: From the Past to the Future 1999 SIGMOD