Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Пояснюваний XGBoost× | XGBoost× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2016–2020 | 2016 |
| Автор методу≠ | Chen & Guestrin (XGBoost); Lundberg & Lee (SHAP for trees) | Chen, T. & Guestrin, C. |
| Тип≠ | Interpretable ensemble (gradient-boosted trees + SHAP) | Ensemble (gradient-boosted decision trees) |
| Основоположне джерело≠ | 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 ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| Інші назви≠ | XGBoost + SHAP, interpretable XGBoost, XAI-XGBoost, transparent gradient boosting | XGBoost, extreme gradient boosting, scalable tree boosting |
| Пов'язані≠ | 6 | 5 |
| Підсумок≠ | 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. | 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Набір даних ↗ |
|
|