Fast Density-Peaks Clustering: Multicore-based Parallelization Approach

Summary: Ex-DPC (exact) and two approximations (Approx-DPC, S-Approx-DPC) enable sub-quadratic Density-Peaks Clustering. Approx-DPC is parameter-free and yields same centers as Ex-DPC; multicore parallelism speeds all variants, showing accurate clustering. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 6062
Venue: SIGMOD
Year: 2021
Pagerank: 4.1945683e-05
Overall Rank: 11,466 | 20.24%
DOI: 10.1145/3448016.3452781

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Daichi Amagata
2. Takahiro Hara

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
11,467	Fast and Exact Outlier Detection in Metric Spaces: A Proximity Graph-based Approach	2021	SIGMOD	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
270	OPTICS: Ordering Points To Identify the Clustering Structure	1999	SIGMOD	0.00029505642
961	DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation	2015	SIGMOD	0.00015001792
2,093	Scalable K-Means++	2012	VLDB	9.5588104e-05
2,635	NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data	2017	VLDB	8.4045788e-05
2,926	Design Principles for Scaling Multi-core OLTP Under High Contention	2016	SIGMOD	7.884983e-05
3,264	Dynamic Density Based Clustering	2017	SIGMOD	7.3094408e-05
3,295	RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning	2018	SIGMOD	7.2598552e-05
4,083	Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially	2019	VLDB	6.4638932e-05
4,998	Latch-free Synchronization in Database Systems: Silver Bullet or Fool's Gold?	2017	CIDR	5.7757413e-05
5,324	Clustering Stream Data by Exploring the Evolution of Density Mountain	2018	VLDB	5.5691645e-05
5,417	Theoretically-Efficient and Practical Parallel DBSCAN	2020	SIGMOD	5.5194222e-05
5,894	Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space	2018	SIGMOD	5.2864259e-05
7,054	Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability	2018	VLDB	4.8496866e-05
9,420	Local Search Methods for k-Means with Outliers	2017	VLDB	4.3441378e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,295	RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning	2018	SIGMOD	7.2598552e-05
1,595	Fast Algorithms for Projected Clustering	1999	SIGMOD	0.00011222442
3,264	Dynamic Density Based Clustering	2017	SIGMOD	7.3094408e-05
5,324	Clustering Stream Data by Exploring the Evolution of Density Mountain	2018	VLDB	5.5691645e-05
3,597	Parallel Local Graph Clustering	2016	VLDB	6.9345175e-05
11,181	Fast Density-Based Clustering: Geometric Approach	2023	SIGMOD	4.1945683e-05
3,313	Quality and Efficiency in Kernel Density Estimates for Large Data	2013	SIGMOD	7.2381634e-05
7,480	Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms	2024	SIGMOD	4.7180617e-05
11,477	Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering*	2021	SIGMOD	4.1945683e-05
5,417	Theoretically-Efficient and Practical Parallel DBSCAN	2020	SIGMOD	5.5194222e-05