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
3004
Venue
SIGMOD
Year
1998
Pagerank
0.00026854084
Overall Rank
340 | 97.64%
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
263 OPTICS: Ordering Points To Identify the Clustering Structure 1999 SIGMOD 0.00029955858
663 A Framework for Clustering Evolving Data Streams 2003 VLDB 0.00018466049
697 Efficient Algorithms for Mining Outliers from Large Data Sets 2000 SIGMOD 0.00017964755
1,240 Multi-dimensional Selectivity Estimation Using Compressed Histogram Information 1999 SIGMOD 0.00013090678
1,596 Fast Algorithms for Projected Clustering 1999 SIGMOD 0.00011210688
1,599 Semantic Compression and Pattern Extraction with Fascicles 1999 VLDB 0.00011203327
1,802 Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces 2000 VLDB 0.0001048177
1,863 Approximation Algorithms for Clustering Uncertain Data 2008 PODS 0.00010287379
2,012 ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search 2011 SIGMOD 9.8007613e-05
2,146 Scalable K-Means++ 2012 VLDB 9.4341455e-05
2,285 Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data 2001 SIGMOD 9.1097273e-05
2,403 Maintaining Variance and k–Medians over Data Stream Windows 2003 PODS 8.8738166e-05
2,786 Approximate XML Joins 2002 SIGMOD 8.1223413e-05
3,301 Indexing the Distance: An Efficient Method to KNN Processing 2001 VLDB 7.2450912e-05
3,366 Modeling and Querying Possible Repairs in Duplicate Detection 2009 VLDB 7.1671634e-05
3,381 A Monte Carlo Algorithm for Fast Projective Clustering 2002 SIGMOD 7.1538392e-05
3,651 Using Trees to Depict a Forest 2009 VLDB 6.8727613e-05
4,177 Density Biased Sampling: An Improved Method for Data Mining and Clustering 2000 SIGMOD 6.3768049e-05
4,333 LinkClus: Efficient Clustering via Heterogeneous Semantic Links 2006 VLDB 6.273124e-05
4,549 Outlier Detection for High Dimensional Data 2001 SIGMOD 6.0866685e-05
4,792 YADING: Fast Clustering of Large-Scale Time Series Data 2015 VLDB 5.9132429e-05
5,000 Density-based Place Clustering in Geo-Social Networks 2014 SIGMOD 5.7636502e-05
6,000 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.2365238e-05
6,542 A Framework for Measuring Changes in Data Characteristics 1999 PODS 5.0147398e-05
6,892 C2P: Clustering based on Closest Pairs 2001 VLDB 4.8889412e-05
7,704 Clustering Objects on a Spatial Network 2004 SIGMOD 4.6681826e-05
9,066 MAIDS: Mining Alarming Incidents from Data Streams 2004 SIGMOD 4.3991821e-05
9,067 A Framework for Projected Clustering of High Dimensional Data Streams 2004 VLDB 4.3991821e-05
9,426 Local Search Methods for k-Means with Outliers 2017 VLDB 4.3399748e-05
9,790 Distance-Based Outlier Detection: Consolidation and Renewed Bearing 2010 VLDB 4.2782534e-05
10,927 k-Clustering with Comparison and Distance Oracles 2024 PODS 4.1905499e-05
12,580 k-Means Projective Clustering 2004 PODS 4.1905499e-05
12,631 A Shrinking-Based Approach for Multi-Dimensional Data Analysis 2003 VLDB 4.1905499e-05
12,696 Data Mining on an OLTP System (Nearly) for Free 2000 SIGMOD 4.1905499e-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.0016113151
24 The R+-Tree: A Dynamic Index For Multi-Dimensional Objects 1987 VLDB 0.00083300888
27 Efficient and Effective Clustering Methods for Spatial Data Mining 1994 VLDB 0.00080846213
33 BIRCH: An Efficient Data Clustering Method for Very Large Databases 1996 SIGMOD 0.00077399244
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
1,863 Approximation Algorithms for Clustering Uncertain Data 2008 PODS 0.00010287379
697 Efficient Algorithms for Mining Outliers from Large Data Sets 2000 SIGMOD 0.00017964755
488 Data Curation at Scale: The Data Tamer System 2013 CIDR 0.00022029993
277 Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications 1998 SIGMOD 0.00029356968
3,477 Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering 1999 VLDB 7.0558203e-05
4,125 Computing Clusters of Correlation Connected Objects 2004 SIGMOD 6.4248096e-05
1,596 Fast Algorithms for Projected Clustering 1999 SIGMOD 0.00011210688
6,739 CURE for Cubes: Cubing Using a ROLAP Engine 2006 VLDB 4.9413138e-05
9,923 On Saving Outliers for Better Clustering over Noisy Data 2021 SIGMOD 4.2503475e-05
13,940 Clustering Methods for Large Databases: From the Past to the Future 1999 SIGMOD -