方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 可解释XGBoost× | 可解释随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2016–2020 | 2001–2017 |
| 提出者≠ | Chen & Guestrin (XGBoost); Lundberg & Lee (SHAP for trees) | Breiman, L. (RF); Lundberg & Lee (SHAP attribution) |
| 类型≠ | Interpretable ensemble (gradient-boosted trees + SHAP) | Interpretable 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(1), 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 ↗ |
| 别名 | XGBoost + SHAP, interpretable XGBoost, XAI-XGBoost, transparent gradient boosting | XRF, interpretable random forest, transparent random forest, random forest with explainability |
| 相关≠ | 6 | 4 |
| 摘要≠ | Explainable XGBoost pairs the high predictive accuracy of XGBoost gradient-boosted trees with SHAP (SHapley Additive exPlanations) values to make each prediction fully auditable. The result is a model that matches or surpasses neural networks on tabular data while offering theoretically grounded, per-prediction feature attributions that satisfy both scientific transparency and regulatory demands. | 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数据集 ↗ |
|
|