Confronta i metodi

	Ensemble a votazione	Boosting	Random Forest
Campo	Apprendimento automatico	Apprendimento automatico	Apprendimento automatico
Famiglia	Machine learning	Machine learning	Machine learning
Anno di origine	1990s–2004	1990–1997	2001
Ideatore	Lam & Suen; Kuncheva, L. I. (systematic treatment)	Schapire, R. E.; Freund, Y.	Breiman, L.
Tipo	Ensemble (combination of multiple classifiers by vote)	Sequential ensemble (iterative reweighting)	Ensemble (bagging of decision trees)
Fonte seminale	Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8	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. (2001). Random Forests. Machine Learning, 45, 5–32.
Alias	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Correlati	5	6	4
Sintesi	A voting ensemble trains several diverse classifiers independently and combines their predictions by a vote: hard voting picks the class chosen by the most models, while soft voting averages their class-probability estimates, optionally with per-model weights. The combination usually outperforms any individual member, and requires no additional training after the base models are fitted.	Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.	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.