ScholarGate
助手
Machine learningMachine learning

Robust HDBSCAN

Robust HDBSCAN (HDBSCAN*) 算法通过一个鲁棒的单链接框架扩展了原始的 HDBSCAN 算法,该框架能更可靠地处理噪声、离群点和不同密度的簇。该算法由 Campello 等人 (2015) 提出,它将任何基于密度的层次结构转换为稳定的平面聚类,同时显式地对噪声点进行建模——无需用户预先指定簇的数量。

在 MethodMind 中打开即将推出视频即将推出Download slides

阅读完整方法

仅限会员

使用免费账户登录即可阅读本节。

登录

Method map

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

来源

  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

如何引用本页

ScholarGate. (2026, June 3). Robust Hierarchical Density-Based Spatial Clustering of Applications with Noise. ScholarGate. https://scholargate.app/zh/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

被引用于

ScholarGateRobust HDBSCAN (Robust Hierarchical Density-Based Spatial Clustering of Applications with Noise). 于 2026-06-15 检索自 https://scholargate.app/zh/machine-learning/robust-hdbscan · 数据集: https://doi.org/10.5281/zenodo.20539026