방법 비교

	Robust Voting Ensemble	배깅 (Bootstrap Aggregating)
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2000s–2010s	1996
창시자	Dietterich, T. G. (ensemble voting foundations); robustification extensions developed broadly in the ML community	Breiman, L.
유형	Robust ensemble aggregation	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)
원전	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.
별칭	robust majority voting, robust vote aggregation, noise-tolerant voting ensemble, fault-tolerant classifier combination	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor
관련	6	5
요약	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.