Document Open Access Logo

Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces

Authors Mark de Berg, Ade Gunawan, Marcel Roeloffzen

PDF

File

Thumbnail PDF
PDF
LIPIcs.ISAAC.2017.25.pdf
  • Filesize: 0.58 MB
  • 13 pages

Document Identifiers

Subject Classification

Keywords
  • Density-based clustering
  • hierarchical clustering

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We present a new algorithm for the widely used density-based clustering method DBScan. Our algorithm computes the DBScan-clustering in O(n log n) time in R^2, irrespective of the scale parameter \eps, but assuming the second parameter MinPts is set to a fixed constant, as is the case in practice.
We also present an O(n log n) randomized algorithm for HDBScan in the plane---HDBScans is a hierarchical version of DBScan introduced recently---and we show how to compute an approximate version of HDBScan in near-linear time in any fixed dimension.

Cite As Get BibTex

Mark de Berg, Ade Gunawan, and Marcel Roeloffzen. Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 25:1-25:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/LIPIcs.ISAAC.2017.25

Author Details

Mark de Berg
Ade Gunawan
Marcel Roeloffzen
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact