Dynamic Density Based Clustering
Summary: Dynamic clustering for density-based DBSCAN under insertions/deletions; rho-approximate DBSCAN shares the same fully dynamic hardness. A small relaxation (the sandwich guarantee) yields near-constant updates and two orders of magnitude speedups over prior approaches. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Junhao Gan (University of Queensland)
- 2. Yufei Tao (University of Queensland)
BibTeX Citation
@inproceedings{gan_sigmod17,
title = {{Dynamic Density Based Clustering}},
author = {Gan, Junhao and Tao, Yufei},
series = {{SIGMOD} '17},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3035918.3064050},
url = {https://dl.acm.org/doi/10.1145/3035918.3064050},
year = {2017}
}
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,135 | Real-Time Distance-Based Outlier Detection in Data Streams | 2021 | VLDB | 7.7214053e-05 |
| 3,234 | RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning | 2018 | SIGMOD | 7.6144184e-05 |
| 4,423 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD | 6.7107949e-05 |
| 5,335 | Clustering Stream Data by Exploring the Evolution of Density Mountain | 2018 | VLDB | 6.2618226e-05 |
| 5,483 | DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows | 2022 | SIGMOD | 6.2019677e-05 |
| 5,867 | Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space | 2018 | SIGMOD | 6.0613257e-05 |
| 10,567 | FB*: A Compact Index for Efficient and Exact Density-based Clustering | 2026 | VLDB | 5.093636e-05 |
| 11,105 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB | 5.093636e-05 |
| 11,664 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0020210012 |
| 4 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.001157935 |
| 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 |
| 1,907 | Incremental Clustering for Mining in a Data Warehousing Environment | 1998 | VLDB | 9.501636e-05 |
| 7,291 | Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering | 2004 | SIGMOD | 5.6539603e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,141 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB |
| 2 | 11,664 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD |
| 3 | 2,556 | NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data | 2017 | VLDB |
| 4 | 5,294 | Theoretically-Efficient and Practical Parallel DBSCAN | 2020 | SIGMOD |
| 5 | 4,423 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD |
| 6 | 8,070 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD |
| 7 | 10,195 | Approximate DBSCAN via Density-Biased Sampling and Kernel Density Estimation | 2026 | SIGMOD |
| 8 | 7,500 | Approximate DBSCAN under Differential Privacy | 2025 | SIGMOD |
| 9 | 11,387 | Fast Density-Based Clustering: Geometric Approach | 2023 | SIGMOD |
| 10 | 962 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD |