C2P: Clustering based on Closest Pairs

Summary: C2P: clustering for large spatial databases using spatial access methods to locate closest pairs. Extensions enable scalable clustering for diverse shapes and outliers, blending hierarchical and graph-theoretic approaches; validated analytically and experimentally. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 8948
Venue: VLDB
Year: 2001
Pagerank: 5.7242118e-05
Overall Rank: 7,023 | 51.82%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Alexandros Nanopoulos (Aristotle University)
2. Yannis Theodoridis (Computer Technology Institute)
3. Yannis Manolopoulos (Aristotle University; University of Cyprus)

BibTeX Citation

@article{nanopoulos_vldb01,
        title = {{C2P: Clustering based on Closest Pairs}},
        author = {Nanopoulos, Alexandros and Theodoridis, Yannis and Manolopoulos, Yannis},
        journal = {PVLDB},
        series = {{VLDB} '01},
        year = {2001}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
7,602	Clustering Objects on a Spatial Network	2004	SIGMOD	5.5866563e-05
11,408	Closest Pairs Search Over Data Stream	2023	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
31	BIRCH: An Efficient Data Clustering Method for Very Large Databases	1996	SIGMOD	0.00050347119
88	Efficient and Effective Clustering Methods for Spatial Data Mining	1994	VLDB	0.00035240327
291	OPTICS: Ordering Points To Identify the Clustering Structure	1999	SIGMOD	0.00022264197
351	CURE: An Efficient Clustering Algorithm for Large Databases	1998	SIGMOD	0.00020424271
1,285	STING: A Statistical Information Grid Approach to Spatial Data Mining	1997	VLDB	0.00011321748
1,525	Incremental Distance Join Algorithms for Spatial Databases	1998	SIGMOD	0.00010493702
1,685	Closest Pair Queries in Spatial Databases	2000	SIGMOD	0.00010017073
1,833	Finding Generalized Projected Clusters in High Dimensional Spaces	2000	SIGMOD	9.6566846e-05
3,663	Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering	1999	VLDB	7.2151113e-05
4,222	Density Biased Sampling: An Improved Method for Data Mining and Clustering	2000	SIGMOD	6.8227421e-05
9,013	Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering	2001	SIGMOD	5.3321448e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,833	Finding Generalized Projected Clusters in High Dimensional Spaces	2000	SIGMOD
2	2,327	Capacity Constrained Assignment in Spatial Databases	2008	SIGMOD
3	4,812	Clustering by Pattern Similarity in Large Data Sets	2002	SIGMOD
4	11,664	Fast Density-Peaks Clustering: Multicore-based Parallelization Approach	2021	SIGMOD
5	2,349	On Efficient Spatial Matching	2007	VLDB
6	8,848	A Generalized Approach for Reducing Expensive Distance Calls for A Broad Class of Proximity Problems	2021	SIGMOD
7	11,675	Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering*	2021	SIGMOD
8	88	Efficient and Effective Clustering Methods for Spatial Data Mining	1994	VLDB
9	7,602	Clustering Objects on a Spatial Network	2004	SIGMOD
10	1,685	Closest Pair Queries in Spatial Databases	2000	SIGMOD