Comparer des méthodes

	Ensemble de vote robuste	Ensemble par vote
Domaine	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning
Année d'origine	2000s–2010s	1990s–2004
Auteur d'origine	Dietterich, T. G. (ensemble voting foundations); robustification extensions developed broadly in the ML community	Lam & Suen; Kuncheva, L. I. (systematic treatment)
Type	Robust ensemble aggregation	Ensemble (combination of multiple classifiers by vote)
Source fondatrice	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
Alias	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
Apparentées	6	5
Résumé	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.