Research map / Learning theory and algorithms / Sample complexity
DBSCAN: Optimal Rates For Density-Based Cluster Estimation
Daren Wang, Xinyang Lu, Alessandro Rinaldo
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- DBSCAN++: Towards fast and scalable density clustering (ICML 2019 · similarity 0.93)
- Faster DBSCAN via subsampled similarity queries (NeurIPS 2020 · similarity 0.90)
- Adaptive Clustering Using Kernel Density Estimators (JMLR 2023 · similarity 0.90)
- Almost Linear Time Density Level Set Estimation via DBSCAN (AAAI 2021 · similarity 0.89)
- Scalable DBSCAN with Random Projections (NeurIPS 2024 · similarity 0.88)
- Breaking the curse of dimensionality in structured density estimation (NeurIPS 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
