ScholarGate
助手

方法对比

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

半监督 HDBSCAN×半监督DBSCAN×
领域机器学习机器学习
方法族Machine learningMachine learning
起源年份2017–present2000s
提出者McInnes, L.; Healy, J. (base HDBSCAN); semi-supervised extensions by various authorsEster, M. et al. (DBSCAN base); semi-supervised extensions by multiple authors (2000s–2010s)
类型Semi-supervised density-based clusteringConstrained density-based clustering
开创性文献McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI ↗Ester, M., Kriegel, H.-P., Sander, J., & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), pp. 226–231. AAAI Press. link ↗
别名Constrained HDBSCAN, Semi-supervised hierarchical density clustering, HDBSCAN with partial labels, SS-HDBSCANConstrained DBSCAN, SS-DBSCAN, DBSCAN with must-link/cannot-link constraints, seeded DBSCAN
相关65
摘要Semi-supervised HDBSCAN extends the Hierarchical Density-Based Spatial Clustering of Applications with Noise (HDBSCAN) algorithm by incorporating partial supervision — such as must-link and cannot-link pairwise constraints or a small set of labeled examples — to guide the density-based cluster hierarchy toward cluster assignments that are consistent with available domain knowledge.Semi-supervised DBSCAN extends the canonical density-based clustering algorithm (Ester et al., 1996) by incorporating a small set of pairwise or label constraints — must-link pairs that must share a cluster, cannot-link pairs that must be separated, or a handful of known labels — to guide cluster formation while retaining DBSCAN's ability to discover arbitrary-shaped clusters and flag noise points.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

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