השוואת שיטות

	אנסמבל הצבעה	שק (Bootstrap Aggregating)
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1990s–2004	1996
הוגה השיטה	Lam & Suen; Kuncheva, L. I. (systematic treatment)	Breiman, L.
סוג	Ensemble (combination of multiple classifiers by vote)	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)
מקור מכונן	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.
כינויים	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor
קשורות	5	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.