ScholarGate
Assistent
Machine learningMachine learning

Robust HDBSCAN

Robust HDBSCAN (HDBSCAN*) udvider den oprindelige HDBSCAN-algoritme med et robust single-linkage-framework, der håndterer støj, outliers og klynger af varierende tætheder mere pålideligt. Introduceret af Campello et al. (2015), konverterer den ethvert tæthedsbaseret hierarki til en stabil flad klyngedannelse, mens den eksplicit modellerer støj-punkter — uden at kræve, at brugeren forudspecificerer antallet af klynger.

Åbn i MethodMindSnartVideoSnartDownload slides

Læs hele metoden

Kun for medlemmer

Log ind med en gratis konto for at læse dette afsnit.

Log ind

Method map

The neighbourhood of related methods — select a node to explore.

Kilder

  1. Campello, R.J.G.B., Moulavi, D., Zimek, A. & Sander, J. (2015). Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection. ACM Transactions on Knowledge Discovery from Data, 10(1), 5. DOI: 10.1145/2733381
  2. McInnes, L., Healy, J. & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI: 10.21105/joss.00205

Sådan citerer du denne side

ScholarGate. (2026, June 3). Robust Hierarchical Density-Based Spatial Clustering of Applications with Noise. ScholarGate. https://scholargate.app/da/machine-learning/robust-hdbscan

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

Refereret af

ScholarGateRobust HDBSCAN (Robust Hierarchical Density-Based Spatial Clustering of Applications with Noise). Hentet 2026-06-15 fra https://scholargate.app/da/machine-learning/robust-hdbscan · Datasæt: https://doi.org/10.5281/zenodo.20539026