مقایسهٔ روش‌ها

	رأی‌گیری قوی گروهی (Robust Voting Ensemble)	بگینگ (تجمیع بوت‌استرپ)	کیسه‌بندی مقاوم
حوزه	یادگیری ماشین	یادگیری ماشین	یادگیری ماشین
خانواده	Machine learning	Machine learning	Machine learning
سال پیدایش	2000s–2010s	1996	1996–2000s
پدیدآور	Dietterich, T. G. (ensemble voting foundations); robustification extensions developed broadly in the ML community	Breiman, L.	Breiman, L. (bagging); robust variants developed by various authors in 2000s
نوع	Robust ensemble aggregation	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Ensemble (robust bootstrap aggregating)
منبع بنیادین	Dietterich, T. G. (2000). Ensemble methods in machine learning. In J. Kittler & F. Roli (Eds.), Multiple Classifier Systems, LNCS 1857, 1–15. Springer.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140.
نام‌های دیگر	robust majority voting, robust vote aggregation, noise-tolerant voting ensemble, fault-tolerant classifier combination	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	robust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGing
مرتبط	6	5	6
خلاصه	Robust Voting Ensemble combines predictions from multiple base classifiers using noise-tolerant aggregation — such as weighted voting, trimmed voting, or median-based combination — to produce final decisions that remain reliable when individual classifiers are corrupted by noisy labels, adversarial inputs, or distributional shift.	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.	Robust Bagging extends the classic Bootstrap Aggregating (Bagging) framework by replacing or augmenting standard base learners with robust estimators — or by using robust aggregation rules — so that the ensemble remains accurate even when training data contain outliers, mislabelled instances, or heavy-tailed noise distributions.