ScholarGate
Assistent

Sammenlign metoder

Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.

Forklarlig HDBSCAN×Forklarlig Random Forest×
FagområdeMaskinlæringMaskinlæring
FamilieMachine learningMachine learning
Oprindelsesår2017–20202001–2017
OphavspersonMcInnes, L.; Healy, J. (HDBSCAN); Lundberg & Lee (SHAP-based explanation)Breiman, L. (RF); Lundberg & Lee (SHAP attribution)
TypeExplainable clusteringInterpretable ensemble (bagging + post-hoc attribution)
Oprindelig kildeMcInnes, 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 ↗
AliasserXAI-HDBSCAN, Interpretable HDBSCAN, Explainable Hierarchical DBSCAN, HDBSCAN with XAIXRF, interpretable random forest, transparent random forest, random forest with explainability
Relaterede64
Resumé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.
ScholarGateDatasæt
  1. v1
  2. 2 Kilder
  3. PUBLISHED
  1. v1
  2. 2 Kilder
  3. PUBLISHED

Gå til søgning Hent slides

ScholarGateSammenlign metoder: Explainable HDBSCAN · Explainable Random Forest. Hentet 2026-06-15 fra https://scholargate.app/da/compare