ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

설명 가능한 HDBSCAN×Explainable Random Forest×
분야머신러닝머신러닝
계열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/ko/compare