Сравнение на методи

	Гласуваща ансамблова схема	Bagging (Bootstrap Aggregating)	Случайна гора
Област	Машинно обучение	Машинно обучение	Машинно обучение
Семейство	Machine learning	Machine learning	Machine learning
Година на възникване	1990s–2004	1996	2001
Създател	Lam & Suen; Kuncheva, L. I. (systematic treatment)	Breiman, L.	Breiman, L.
Тип	Ensemble (combination of multiple classifiers by vote)	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Ensemble (bagging of decision trees)
Основополагащ източник	Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Други названия	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Свързани	5	5	4
Резюме	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.	Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.	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.