Comparer des méthodes

	Ensemble de vote robuste	Empilement
Domaine	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning
Année d'origine	2000s–2010s	1992
Auteur d'origine	Dietterich, T. G. (ensemble voting foundations); robustification extensions developed broadly in the ML community	Wolpert, D.H.
Type	Robust ensemble aggregation	Ensemble (heterogeneous meta-learning)
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.	Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259.
Alias	robust majority voting, robust vote aggregation, noise-tolerant voting ensemble, fault-tolerant classifier combination	Stacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner
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.	Stacking, or stacked generalization, is an ensemble method introduced by David Wolpert in 1992 that combines the outputs of several different base models (Level-0) through a separate meta-model (Level-1). Unlike bagging and boosting, it deliberately uses heterogeneous model types, and it is the standard final-stage strategy in Kaggle competitions.