Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Gradient Boosting Explicabil× | XGBoost× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2017–2020 | 2016 |
| Autorul original≠ | Lundberg, S. M. & Lee, S.-I. (TreeSHAP for tree ensembles) | Chen, T. & Guestrin, C. |
| Tip≠ | Ensemble + explainability layer | Ensemble (gradient-boosted decision trees) |
| Sursa seminală≠ | 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 ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| Denumiri alternative≠ | XGB with SHAP, interpretable gradient boosting, transparent gradient boosting, XAI gradient boosting | XGBoost, extreme gradient boosting, scalable tree boosting |
| Înrudite≠ | 6 | 5 |
| Rezumat≠ | 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. | 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. |
| ScholarGateSet de date ↗ |
|
|