Comparar métodos

	AdaBoost	Árbol de Decisión	Random Forest	Stacking
Campo	Aprendizaje automático	Aprendizaje automático	Aprendizaje automático	Aprendizaje automático
Familia	Machine learning	Machine learning	Machine learning	Machine learning
Año de origen	1997	1984	2001	1992
Autor original	Freund, Y. & Schapire, R.E.	Breiman, Friedman, Olshen & Stone	Breiman, L.	Wolpert, D.H.
Tipo	Ensemble (sequential boosting of weak learners)	Recursive partitioning (if-then rules)	Ensemble (bagging of decision trees)	Ensemble (heterogeneous meta-learning)
Fuente seminal	Freund, Y. & Schapire, R.E. (1997). A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. Journal of Computer and System Sciences, 55(1), 119–139.	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259.
Alias	AdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırma	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	Stacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner
Relacionados	5	5	4	5
Resumen	AdaBoost (Adaptive Boosting) is the original boosting algorithm, introduced by Yoav Freund and Robert Schapire in 1997, that combines a sequence of simple weak learners by giving more weight to the observations they get wrong. The forerunner of gradient boosting, it is simple, interpretable, and a strong baseline for classification.	A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.	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.