ScholarGate
助手

方法对比

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

可解释梯度提升×可解释随机森林×
领域机器学习机器学习
方法族Machine learningMachine learning
起源年份2017–20202001–2017
提出者Lundberg, S. M. & Lee, S.-I. (TreeSHAP for tree ensembles)Breiman, L. (RF); Lundberg & Lee (SHAP attribution)
类型Ensemble + explainability layerInterpretable ensemble (bagging + post-hoc attribution)
开创性文献Lundberg, S. M., Erion, G., Chen, H., DeGrave, A., Prutkin, J. M., Nair, B., Katz, R., Himmelfarb, J., Bansal, N., & Lee, S.-I. (2020). From local explanations to global understanding with explainable AI for trees. Nature Machine Intelligence, 2, 56–67. 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 ↗
别名XGB with SHAP, interpretable gradient boosting, transparent gradient boosting, XAI gradient boostingXRF, interpretable random forest, transparent random forest, random forest with explainability
相关64
摘要Explainable Gradient Boosting combines the predictive power of gradient boosting ensembles with structured interpretability tools — principally SHAP (SHapley Additive exPlanations) — to produce models that are both highly accurate and transparently auditable. Practitioners obtain global feature rankings and individual-level explanations alongside standard performance metrics.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 Gradient Boosting · Explainable Random Forest. 于 2026-06-15 检索自 https://scholargate.app/zh/compare