Approximate DBSCAN via Density-Biased Sampling and Kernel Density Estimation
Summary: Reformulates DBSCAN as a Minimum Connected Dominating Set problem. LDBS-KDE combines lattice-based density-biased sampling with KDE-based core detection for substantially faster approximation, achieving competitive or superior accuracy. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Jian Lin (Shenzhen University)
- 2. Siyue Wu (Shenzhen University)
- 3. Dingming Wu (Shenzhen University)
- 4. Tsz Nam Chan (Shenzhen University)
BibTeX Citation
@inproceedings{lin_sigmod26,
title = {{Approximate DBSCAN via Density-Biased Sampling and Kernel Density Estimation}},
author = {Lin, Jian and Wu, Siyue and Wu, Dingming and Chan, Tsz Nam},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3802013},
url = {https://dl.acm.org/doi/10.1145/3802013},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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 |
|---|---|---|---|---|
| 962 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD | 0.00012936472 |
| 2,638 | Quality and Efficiency in Kernel Density Estimates for Large Data | 2013 | SIGMOD | 8.3130624e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,664 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD |
| 2 | 2,638 | Quality and Efficiency in Kernel Density Estimates for Large Data | 2013 | SIGMOD |
| 3 | 4,465 | Scalable Kernel Density Classification via Threshold-Based Pruning | 2017 | SIGMOD |
| 4 | 5,294 | Theoretically-Efficient and Practical Parallel DBSCAN | 2020 | SIGMOD |
| 5 | 7,500 | Approximate DBSCAN under Differential Privacy | 2025 | SIGMOD |
| 6 | 962 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD |
| 7 | 3,020 | Dynamic Density Based Clustering | 2017 | SIGMOD |
| 8 | 11,387 | Fast Density-Based Clustering: Geometric Approach | 2023 | SIGMOD |
| 9 | 2,556 | NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data | 2017 | VLDB |
| 10 | 8,070 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD |