Comparar métodos

	Stacking	XGBoost
Área	Aprendizado de máquina	Aprendizado de máquina
Família	Machine learning	Machine learning
Ano de origem	1992	2016
Autor original	Wolpert, D.H.	Chen, T. & Guestrin, C.
Tipo	Ensemble (heterogeneous meta-learning)	Ensemble (gradient-boosted decision trees)
Fonte seminal	Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
Outros nomes	Stacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner	XGBoost, extreme gradient boosting, scalable tree boosting
Relacionados	5	5
Resumo	Stacking, or stacked generalization, is an ensemble method introduced by David Wolpert in 1992 that combines the outputs of several different base models (Level-0) through a separate meta-model (Level-1). Unlike bagging and boosting, it deliberately uses heterogeneous model types, and it is the standard final-stage strategy in Kaggle competitions.	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.