ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

HDBSCAN×DBSCAN×
领域机器学习机器学习
方法族Machine learningMachine learning
起源年份20131996
提出者Campello, R. J. G. B.; Moulavi, D.; Sander, J.Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.
类型Hierarchical density-based clusteringDensity-based clustering algorithm
开创性文献Campello, R. J. G. B., Moulavi, D., & Sander, J. (2013). Density-Based Clustering Based on Hierarchical Density Estimates. In J. Pei et al. (Eds.), Advances in Knowledge Discovery and Data Mining. PAKDD 2013. Lecture Notes in Computer Science, vol. 7819 (pp. 160–172). Springer, Berlin, Heidelberg. DOI ↗Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231. link ↗
别名HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*DBSCAN Kümeleme, density-based clustering, density-based spatial clustering
相关33
摘要HDBSCAN (Hierarchical Density-Based Spatial Clustering of Applications with Noise) is a density-based clustering algorithm introduced by Campello, Moulavi, and Sander in 2013. It extends DBSCAN by building a full hierarchy of density-based clusters across all density scales and then extracting a stable flat partition, making it robust to datasets where cluster densities vary substantially across regions.DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.
ScholarGate数据集
  1. v1
  2. 3 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: HDBSCAN · DBSCAN. 于 2026-06-17 检索自 https://scholargate.app/zh/compare