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: 6124
Venue: SIGMOD
Year: 2021
Pagerank: 5.093636e-05
Overall Rank: 11,664 | 19.98%
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 (Osaka University)
2. Takahiro Hara (Osaka University)

BibTeX Citation

@inproceedings{amagata_sigmod21,
        title = {{Fast Density-Peaks Clustering: Multicore-based Parallelization Approach}},
        author = {Amagata, Daichi and Hara, Takahiro},
        series = {{SIGMOD} '21},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3448016.3452781},
        url = {https://dl.acm.org/doi/10.1145/3448016.3452781},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
9,634	Fast and Exact Outlier Detection in Metric Spaces: A Proximity Graph-based Approach	2021	SIGMOD	5.2434488e-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
291	OPTICS: Ordering Points To Identify the Clustering Structure	1999	SIGMOD	0.00022264197
962	DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation	2015	SIGMOD	0.00012936472
2,085	Scalable K-Means++	2012	VLDB	9.1943614e-05
2,234	Design Principles for Scaling Multi-core OLTP Under High Contention	2016	SIGMOD	8.8937932e-05
2,556	NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data	2017	VLDB	8.4162172e-05
3,020	Dynamic Density Based Clustering	2017	SIGMOD	7.8445412e-05
3,234	RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning	2018	SIGMOD	7.6144184e-05
4,296	Latch-free Synchronization in Database Systems: Silver Bullet or Fool's Gold?	2017	CIDR	6.7773228e-05
4,366	Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially	2019	VLDB	6.7407122e-05
5,294	Theoretically-Efficient and Practical Parallel DBSCAN	2020	SIGMOD	6.2790627e-05
5,335	Clustering Stream Data by Exploring the Evolution of Density Mountain	2018	VLDB	6.2618226e-05
5,867	Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space	2018	SIGMOD	6.0613257e-05
7,151	Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability	2018	VLDB	5.6873519e-05
9,575	Local Search Methods for k-Means with Outliers	2017	VLDB	5.2528121e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,195	Approximate DBSCAN via Density-Biased Sampling and Kernel Density Estimation	2026	SIGMOD
2	10,567	FB*: A Compact Index for Efficient and Exact Density-based Clustering	2026	VLDB
3	3,020	Dynamic Density Based Clustering	2017	SIGMOD
4	5,335	Clustering Stream Data by Exploring the Evolution of Density Mountain	2018	VLDB
5	3,616	Parallel Local Graph Clustering	2016	VLDB
6	11,387	Fast Density-Based Clustering: Geometric Approach	2023	SIGMOD
7	2,638	Quality and Efficiency in Kernel Density Estimates for Large Data	2013	SIGMOD
8	8,070	Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms	2024	SIGMOD
9	11,675	Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering*	2021	SIGMOD
10	5,294	Theoretically-Efficient and Practical Parallel DBSCAN	2020	SIGMOD