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 (Institute of Information Science and Technologies, National Research Council; University of Pisa)
- 2. Matteo Dell'Amico (Symantec Research Labs)
- 3. Pietro Michiardi (EURECOM)
- 4. Laura Ricci (Institute of Information Science and Technologies, National Research Council; University of Pisa)
BibTeX Citation
@article{lulli_vldb17,
title = {{NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data}},
author = {Lulli, Alessandro and Dell'Amico, Matteo and Michiardi, Pietro and Ricci, Laura},
journal = {PVLDB},
series = {{VLDB} '17},
volume = {10},
number = {3},
pages = {157},
doi = {10.14778/3021924.3021932},
url = {https://doi.org/10.14778/3021924.3021932},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,300 | RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning | 2018 | SIGMOD | 7.443826e-05 |
| 5,417 | Theoretically-Efficient and Practical Parallel DBSCAN | 2020 | SIGMOD | 6.138409e-05 |
| 5,612 | DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows | 2022 | SIGMOD | 6.0683695e-05 |
| 7,096 | A New Sparse Data Clustering Method Based On Frequent Items | 2023 | SIGMOD | 5.601767e-05 |
| 7,502 | On the Efficiency of K-Means Clustering: Evaluation, Optimization, and Algorithm Selection | 2021 | VLDB | 5.5076707e-05 |
| 8,240 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD | 5.370583e-05 |
| 11,702 | Fast Density-Based Clustering: Geometric Approach | 2023 | SIGMOD | 4.9793485e-05 |
| 11,971 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD | 4.9793485e-05 |
| 11,982 | Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* | 2021 | SIGMOD | 4.9793485e-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 |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012092602 |
| 986 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD | 0.00012668888 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,945 | Incremental Clustering for Mining in a Data Warehousing Environment | 1998 | VLDB |
| 2 | 11,971 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD |
| 3 | 3,300 | RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning | 2018 | SIGMOD |
| 4 | 986 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD |
| 5 | 7,642 | Approximate DBSCAN under Differential Privacy | 2025 | SIGMOD |
| 6 | 3,057 | Dynamic Density Based Clustering | 2017 | SIGMOD |
| 7 | 5,417 | Theoretically-Efficient and Practical Parallel DBSCAN | 2020 | SIGMOD |
| 8 | 11,702 | Fast Density-Based Clustering: Geometric Approach | 2023 | SIGMOD |
| 9 | 8,240 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD |
| 10 | 10,411 | Approximate DBSCAN via Density-Biased Sampling and Kernel Density Estimation | 2026 | SIGMOD |