Database Paper Browser

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
3003
Venue
SIGMOD
Year
1998
Pagerank
0.00026810548
Overall Rank
341 | 97.63%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 34 of 34 citing papers.

Rank Citing Paper Year Venue Pagerank
270 OPTICS: Ordering Points To Identify the Clustering Structure 1999 SIGMOD 0.00029505642
662 A Framework for Clustering Evolving Data Streams 2003 VLDB 0.00018475968
701 Efficient Algorithms for Mining Outliers from Large Data Sets 2000 SIGMOD 0.00017938417
1,241 Multi-dimensional Selectivity Estimation Using Compressed Histogram Information 1999 SIGMOD 0.00013097578
1,595 Fast Algorithms for Projected Clustering 1999 SIGMOD 0.00011222442
1,598 Semantic Compression and Pattern Extraction with Fascicles 1999 VLDB 0.00011202905
1,806 Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces 2000 VLDB 0.00010490769
1,860 Approximation Algorithms for Clustering Uncertain Data 2008 PODS 0.0001028857
2,024 ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search 2011 SIGMOD 9.7519678e-05
2,093 Scalable K-Means++ 2012 VLDB 9.5588104e-05
2,281 Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data 2001 SIGMOD 9.1077704e-05
2,404 Maintaining Variance and k–Medians over Data Stream Windows 2003 PODS 8.8837279e-05
2,784 Approximate XML Joins 2002 SIGMOD 8.128931e-05
3,300 Indexing the Distance: An Efficient Method to KNN Processing 2001 VLDB 7.2516103e-05
3,360 Modeling and Querying Possible Repairs in Duplicate Detection 2009 VLDB 7.1742067e-05
3,376 A Monte Carlo Algorithm for Fast Projective Clustering 2002 SIGMOD 7.1630476e-05
3,654 Using Trees to Depict a Forest 2009 VLDB 6.873144e-05
4,177 Density Biased Sampling: An Improved Method for Data Mining and Clustering 2000 SIGMOD 6.3835403e-05
4,342 LinkClus: Efficient Clustering via Heterogeneous Semantic Links 2006 VLDB 6.2758722e-05
4,552 Outlier Detection for High Dimensional Data 2001 SIGMOD 6.0922282e-05
4,823 YADING: Fast Clustering of Large-Scale Time Series Data 2015 VLDB 5.8956566e-05
5,996 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.2415551e-05
6,093 Density-based Place Clustering in Geo-Social Networks 2014 SIGMOD 5.2131159e-05
6,544 A Framework for Measuring Changes in Data Characteristics 1999 PODS 5.0202405e-05
6,883 C2P: Clustering based on Closest Pairs 2001 VLDB 4.8960306e-05
7,608 Clustering Objects on a Spatial Network 2004 SIGMOD 4.6967024e-05
9,067 MAIDS: Mining Alarming Incidents from Data Streams 2004 SIGMOD 4.4034035e-05
9,068 A Framework for Projected Clustering of High Dimensional Data Streams 2004 VLDB 4.4034035e-05
9,420 Local Search Methods for k-Means with Outliers 2017 VLDB 4.3441378e-05
9,787 Distance-Based Outlier Detection: Consolidation and Renewed Bearing 2010 VLDB 4.2823546e-05
10,923 k-Clustering with Comparison and Distance Oracles 2024 PODS 4.1945683e-05
12,571 k-Means Projective Clustering 2004 PODS 4.1945683e-05
12,622 A Shrinking-Based Approach for Multi-Dimensional Data Analysis 2003 VLDB 4.1945683e-05
12,687 Data Mining on an OLTP System (Nearly) for Free 2000 SIGMOD 4.1945683e-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
6 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0016162015
24 The R+-Tree: A Dynamic Index For Multi-Dimensional Objects 1987 VLDB 0.00083378538
27 Efficient and Effective Clustering Methods for Spatial Data Mining 1994 VLDB 0.00080736878
33 BIRCH: An Efficient Data Clustering Method for Very Large Databases 1996 SIGMOD 0.00077324389
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
1,860 Approximation Algorithms for Clustering Uncertain Data 2008 PODS 0.0001028857
701 Efficient Algorithms for Mining Outliers from Large Data Sets 2000 SIGMOD 0.00017938417
277 Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications 1998 SIGMOD 0.00029311426
489 Data Curation at Scale: The Data Tamer System 2013 CIDR 0.00022030728
3,475 Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering 1999 VLDB 7.0614822e-05
4,162 Computing Clusters of Correlation Connected Objects 2004 SIGMOD 6.3937203e-05
1,595 Fast Algorithms for Projected Clustering 1999 SIGMOD 0.00011222442
6,736 CURE for Cubes: Cubing Using a ROLAP Engine 2006 VLDB 4.9459588e-05
9,924 On Saving Outliers for Better Clustering over Noisy Data 2021 SIGMOD 4.2544238e-05
13,926 Clustering Methods for Large Databases: From the Past to the Future 1999 SIGMOD -