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.00019987463
Overall Rank
363 | 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.00021810545
583 Efficient Algorithms for Mining Outliers from Large Data Sets 2000 SIGMOD 0.00015960125
928 A Framework for Clustering Evolving Data Streams 2003 VLDB 0.00013025824
1,077 Multi-dimensional Selectivity Estimation Using Compressed Histogram Information 1999 SIGMOD 0.00012154948
1,634 Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces 2000 VLDB 0.0001001862
1,679 Fast Algorithms for Projected Clustering 1999 SIGMOD 9.9079414e-05
1,756 Semantic Compression and Pattern Extraction with Fascicles 1999 VLDB 9.7140303e-05
1,923 ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search 2011 SIGMOD 9.3750526e-05
1,996 Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data 2001 SIGMOD 9.216723e-05
2,128 Scalable K-Means++ 2012 VLDB 8.9964096e-05
2,260 Maintaining Variance and k–Medians over Data Stream Windows 2003 PODS 8.7353589e-05
2,304 Approximation Algorithms for Clustering Uncertain Data 2008 PODS 8.6702799e-05
2,747 Approximate XML Joins 2002 SIGMOD 8.0614566e-05
3,016 Indexing the Distance: An Efficient Method to KNN Processing 2001 VLDB 7.7483267e-05
3,426 Modeling and Querying Possible Repairs in Duplicate Detection 2009 VLDB 7.3087723e-05
3,618 A Monte Carlo Algorithm for Fast Projective Clustering 2002 SIGMOD 7.1559402e-05
3,963 Using Trees to Depict a Forest 2009 VLDB 6.8922952e-05
4,184 YADING: Fast Clustering of Large-Scale Time Series Data 2015 VLDB 6.7540884e-05
4,299 Outlier Detection for High Dimensional Data 2001 SIGMOD 6.6789252e-05
4,313 Density Biased Sampling: An Improved Method for Data Mining and Clustering 2000 SIGMOD 6.6699869e-05
4,743 Density-based Place Clustering in Geo-Social Networks 2014 SIGMOD 6.4396758e-05
4,785 LinkClus: Efficient Clustering via Heterogeneous Semantic Links 2006 VLDB 6.4150472e-05
7,096 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.601767e-05
7,162 C2P: Clustering based on Closest Pairs 2001 VLDB 5.5957758e-05
7,352 A Framework for Measuring Changes in Data Characteristics 1999 PODS 5.5448455e-05
7,743 Clustering Objects on a Spatial Network 2004 SIGMOD 5.4613068e-05
9,445 MAIDS: Mining Alarming Incidents from Data Streams 2004 SIGMOD 5.1758119e-05
9,446 A Framework for Projected Clustering of High Dimensional Data Streams 2004 VLDB 5.1758119e-05
9,751 Local Search Methods for k-Means with Outliers 2017 VLDB 5.1349531e-05
10,139 Distance-Based Outlier Detection: Consolidation and Renewed Bearing 2010 VLDB 5.0746983e-05
11,491 k-Clustering with Comparison and Distance Oracles 2024 PODS 4.9793485e-05
13,054 k-Means Projective Clustering 2004 PODS 4.9793485e-05
13,105 A Shrinking-Based Approach for Multi-Dimensional Data Analysis 2003 VLDB 4.9793485e-05
13,170 Data Mining on an OLTP System (Nearly) for Free 2000 SIGMOD 4.9793485e-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.0011405675
32 BIRCH: An Efficient Data Clustering Method for Very Large Databases 1996 SIGMOD 0.00049737458
44 The R+-Tree: A Dynamic Multi-Dimensional Index for Objects 1987 VLDB 0.00045337853
94 Efficient and Effective Clustering Methods for Spatial Data Mining 1994 VLDB 0.00034579889
Previous Page 1 / 1 Next

Semantically Similar Papers

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