방법 비교

	Robust Voting Ensemble	부스팅
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2000s–2010s	1990–1997
창시자	Dietterich, T. G. (ensemble voting foundations); robustification extensions developed broadly in the ML community	Schapire, R. E.; Freund, Y.
유형	Robust ensemble aggregation	Sequential ensemble (iterative reweighting)
원전	Dietterich, T. G. (2000). Ensemble methods in machine learning. In J. Kittler & F. Roli (Eds.), Multiple Classifier Systems, LNCS 1857, 1–15. Springer.	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.
별칭	robust majority voting, robust vote aggregation, noise-tolerant voting ensemble, fault-tolerant classifier combination	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
관련	6	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.	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.