השוואת שיטות

	אנסמבל הצבעה	שק (Bootstrap Aggregating)	בוסטינג	עצי-על
תחום	למידת מכונה	למידת מכונה	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning	Machine learning	Machine learning
שנת המקור	1990s–2004	1996	1990–1997	2006
הוגה השיטה	Lam & Suen; Kuncheva, L. I. (systematic treatment)	Breiman, L.	Schapire, R. E.; Freund, Y.	Geurts, P.; Ernst, D.; Wehenkel, L.
סוג	Ensemble (combination of multiple classifiers by vote)	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Sequential ensemble (iterative reweighting)	Ensemble (extremely randomized 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.	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.	Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42.
כינויים	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ET
קשורות	5	5	6	5
תקציר	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.	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.	Extra Trees (Extremely Randomized Trees), introduced by Geurts, Ernst, and Wehenkel in 2006, is an ensemble of decision trees that pushes randomisation further than Random Forest. Both the candidate features and the split thresholds are chosen completely at random at each node, eliminating the greedy search over thresholds. This extra randomness reduces variance, often matches or exceeds Random Forest accuracy, and runs substantially faster at training time.