NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data
Summary: NG-DBSCAN: an approximate, distributed DBSCAN variant for arbitrary data with any symmetric distance. It delivers scalable, fast clustering on large datasets with high-quality results, plus a detailed algorithmic walkthrough and extensive real/synthetic experiments. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Alessandro Lulli
- 2. Matteo Dell'Amico
- 3. Pietro Michiardi
- 4. Laura Ricci
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,295 | RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning | 2018 | SIGMOD | 7.2598552e-05 |
| 4,652 | On the Efficiency of K-Means Clustering: Evaluation, Optimization, and Algorithm Selection | 2021 | VLDB | 6.0228549e-05 |
| 5,417 | Theoretically-Efficient and Practical Parallel DBSCAN | 2020 | SIGMOD | 5.5194222e-05 |
| 5,996 | A New Sparse Data Clustering Method Based On Frequent Items | 2023 | SIGMOD | 5.2415551e-05 |
| 6,125 | DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows | 2022 | SIGMOD | 5.1987868e-05 |
| 7,480 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD | 4.7180617e-05 |
| 11,181 | Fast Density-Based Clustering: Geometric Approach | 2023 | SIGMOD | 4.1945683e-05 |
| 11,466 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD | 4.1945683e-05 |
| 11,477 | Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* | 2021 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0019005923 |
| 961 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD | 0.00015001792 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,368 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD | 4.3481263e-05 |
| 1,816 | Incremental Clustering for Mining in a Data Warehousing Environment | 1998 | VLDB | 0.0001045313 |
| 11,466 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD | 4.1945683e-05 |
| 3,295 | RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning | 2018 | SIGMOD | 7.2598552e-05 |
| 10,470 | Approximate DBSCAN under Differential Privacy | 2025 | SIGMOD | 4.1945683e-05 |
| 961 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD | 0.00015001792 |
| 3,264 | Dynamic Density Based Clustering | 2017 | SIGMOD | 7.3094408e-05 |
| 5,417 | Theoretically-Efficient and Practical Parallel DBSCAN | 2020 | SIGMOD | 5.5194222e-05 |
| 11,181 | Fast Density-Based Clustering: Geometric Approach | 2023 | SIGMOD | 4.1945683e-05 |
| 7,480 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD | 4.7180617e-05 |