방법 비교

	Robust Voting Ensemble	Voting Ensemble
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2000s–2010s	1990s–2004
창시자	Dietterich, T. G. (ensemble voting foundations); robustification extensions developed broadly in the ML community	Lam & Suen; Kuncheva, L. I. (systematic treatment)
유형	Robust ensemble aggregation	Ensemble (combination of multiple classifiers by vote)
원전	Dietterich, T. G. (2000). Ensemble methods in machine learning. In J. Kittler & F. Roli (Eds.), Multiple Classifier Systems, LNCS 1857, 1–15. Springer.	Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8
별칭	robust majority voting, robust vote aggregation, noise-tolerant voting ensemble, fault-tolerant classifier combination	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
관련	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.	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.