ScholarGate
助手

方法对比

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

可解释的极限随机树×XGBoost×
领域机器学习机器学习
方法族Machine learningMachine learning
起源年份2006 (Extra Trees); 2017 (SHAP integration)2016
提出者Geurts, P., Ernst, D., Wehenkel, L. (Extra Trees); Lundberg, S. M. (SHAP explainability layer)Chen, T. & Guestrin, C.
类型Ensemble (randomized trees) with post-hoc explainabilityEnsemble (gradient-boosted decision trees)
开创性文献Geurts, P., Ernst, D., & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
别名XAI-ET, Explainable ET, Interpretable Extra Trees, Extra Trees with SHAPXGBoost, extreme gradient boosting, scalable tree boosting
相关55
摘要Explainable Extra Trees combines the Extremely Randomized Trees (Extra Trees) ensemble algorithm with post-hoc explainability methods — most commonly SHAP values — to deliver both strong predictive performance and transparent, feature-level explanations. It extends the classic Extra Trees classifier or regressor so that every prediction can be decomposed into individual feature contributions, satisfying demands for accountability in applied and regulated domains.XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Explainable Extra Trees · XGBoost. 于 2026-06-15 检索自 https://scholargate.app/zh/compare