ScholarGate
助手

方法对比

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

可解释随机森林×梯度提升(Gradient Boosting)×随机森林×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份2001–201720012001
提出者Breiman, L. (RF); Lundberg & Lee (SHAP attribution)Friedman, J. H.Breiman, L.
类型Interpretable ensemble (bagging + post-hoc attribution)Ensemble (sequential boosting of decision trees)Ensemble (bagging of decision trees)
开创性文献Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
别名XRF, interpretable random forest, transparent random forest, random forest with explainabilityGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
相关454
摘要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.Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

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