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
h132b125455aba2e5
Venue
SIGMOD
Year
1998
Pagerank
0.00019916561
Overall Rank
364 | 97.57%
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
300 OPTICS: Ordering Points To Identify the Clustering Structure 1999 SIGMOD 0.00021743411
587 Efficient Algorithms for Mining Outliers from Large Data Sets 2000 SIGMOD 0.00015900873
933 A Framework for Clustering Evolving Data Streams 2003 VLDB 0.00012976795
1,080 Multi-dimensional Selectivity Estimation Using Compressed Histogram Information 1999 SIGMOD 0.00012114187
1,642 Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces 2000 VLDB 9.9812004e-05
1,685 Fast Algorithms for Projected Clustering 1999 SIGMOD 9.8713731e-05
1,768 Semantic Compression and Pattern Extraction with Fascicles 1999 VLDB 9.6803078e-05
1,928 ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search 2011 SIGMOD 9.3476482e-05
2,007 Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data 2001 SIGMOD 9.182637e-05
2,138 Scalable K-Means++ 2012 VLDB 8.9755133e-05
2,274 Maintaining Variance and k–Medians over Data Stream Windows 2003 PODS 8.7041791e-05
2,319 Approximation Algorithms for Clustering Uncertain Data 2008 PODS 8.6376033e-05
2,757 Approximate XML Joins 2002 SIGMOD 8.0313227e-05
3,025 Indexing the Distance: An Efficient Method to KNN Processing 2001 VLDB 7.7214661e-05
3,437 Modeling and Querying Possible Repairs in Duplicate Detection 2009 VLDB 7.282809e-05
3,627 A Monte Carlo Algorithm for Fast Projective Clustering 2002 SIGMOD 7.1290231e-05
3,983 Using Trees to Depict a Forest 2009 VLDB 6.8662651e-05
4,201 YADING: Fast Clustering of Large-Scale Time Series Data 2015 VLDB 6.7286195e-05
4,317 Outlier Detection for High Dimensional Data 2001 SIGMOD 6.6538797e-05
4,331 Density Biased Sampling: An Improved Method for Data Mining and Clustering 2000 SIGMOD 6.644974e-05
4,739 Density-based Place Clustering in Geo-Social Networks 2014 SIGMOD 6.4295168e-05
4,811 LinkClus: Efficient Clustering via Heterogeneous Semantic Links 2006 VLDB 6.3908502e-05
7,121 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.580601e-05
7,185 C2P: Clustering based on Closest Pairs 2001 VLDB 5.5746325e-05
7,376 A Framework for Measuring Changes in Data Characteristics 1999 PODS 5.5239044e-05
7,762 Clustering Objects on a Spatial Network 2004 SIGMOD 5.4406715e-05
9,484 MAIDS: Mining Alarming Incidents from Data Streams 2004 SIGMOD 5.1562553e-05
9,485 A Framework for Projected Clustering of High Dimensional Data Streams 2004 VLDB 5.1562553e-05
9,788 Local Search Methods for k-Means with Outliers 2017 VLDB 5.115551e-05
10,180 Distance-Based Outlier Detection: Consolidation and Renewed Bearing 2010 VLDB 5.0555297e-05
11,549 k-Clustering with Comparison and Distance Oracles 2024 PODS 4.9605343e-05
13,101 k-Means Projective Clustering 2004 PODS 4.9605343e-05
13,152 A Shrinking-Based Approach for Multi-Dimensional Data Analysis 2003 VLDB 4.9605343e-05
13,217 Data Mining on an OLTP System (Nearly) for Free 2000 SIGMOD 4.9605343e-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.0011386412
32 BIRCH: An Efficient Data Clustering Method for Very Large Databases 1996 SIGMOD 0.00049559562
44 The R+-Tree: A Dynamic Multi-Dimensional Index for Objects 1987 VLDB 0.00045231517
94 Efficient and Effective Clustering Methods for Spatial Data Mining 1994 VLDB 0.00034470298
Previous Page 1 / 1 Next

Semantically Similar Papers

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