ScholarGate
助手

方法对比

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

可解释 HDBSCAN×可解释随机森林×
领域机器学习机器学习
方法族Machine learningMachine learning
起源年份2017–20202001–2017
提出者McInnes, L.; Healy, J. (HDBSCAN); Lundberg & Lee (SHAP-based explanation)Breiman, L. (RF); Lundberg & Lee (SHAP attribution)
类型Explainable clusteringInterpretable ensemble (bagging + post-hoc attribution)
开创性文献McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI ↗Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗
别名XAI-HDBSCAN, Interpretable HDBSCAN, Explainable Hierarchical DBSCAN, HDBSCAN with XAIXRF, interpretable random forest, transparent random forest, random forest with explainability
相关64
摘要Explainable HDBSCAN combines the hierarchical density-based clustering algorithm HDBSCAN with post-hoc explainability methods — primarily SHAP — to reveal which input features drive cluster membership and separation. It retains HDBSCAN's ability to find clusters of varying shape and density while adding a principled, auditable explanation layer.Explainable Random Forest (XRF) combines the predictive power of Breiman's Random Forest ensemble with systematic post-hoc attribution methods — principally SHAP values and mean-decrease-in-impurity importance — to make model decisions transparent and auditable. It delivers both high accuracy and human-interpretable feature contributions, satisfying demands from regulators, domain experts, and academic reviewers alike.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Explainable HDBSCAN · Explainable Random Forest. 于 2026-06-15 检索自 https://scholargate.app/zh/compare