Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| Empilhamento Explicável× | Gradient Boosting× | XGBoost× | |
|---|---|---|---|
| Área | Aprendizado de máquina | Aprendizado de máquina | Aprendizado de máquina |
| Família | Machine learning | Machine learning | Machine learning |
| Ano de origem≠ | 1992 (stacking); 2010s–2020s (explainable extensions) | 2001 | 2016 |
| Autor original≠ | Wolpert, D. H. (stacking); XAI integration developed across the community | Friedman, J. H. | Chen, T. & Guestrin, C. |
| Tipo≠ | Ensemble meta-learning with post-hoc or intrinsic interpretability | Ensemble (sequential boosting of decision trees) | Ensemble (gradient-boosted decision trees) |
| Fonte seminal≠ | Wolpert, D. H. (1992). Stacked generalization. Neural Networks, 5(2), 241–259. DOI ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| Outros nomes≠ | XAI-Stacking, interpretable stacking, transparent stacking ensemble, explainable stacked generalisation | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | XGBoost, extreme gradient boosting, scalable tree boosting |
| Relacionados≠ | 4 | 5 | 5 |
| Resumo≠ | Explainable Stacking Ensemble combines the predictive power of stacked generalisation — training a meta-learner on the outputs of multiple diverse base models — with interpretability tools such as SHAP or LIME that reveal how each base model and each input feature contributed to the final prediction. It bridges the accuracy–transparency trade-off that makes pure stacking opaque in high-stakes settings. | 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. | 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. |
| ScholarGateConjunto de dados ↗ |
|
|
|