Sammenlign metoder

	Robust stemmeensemble	Boosting	Robust Bagging
Fagområde	Maskinlæring	Maskinlæring	Maskinlæring
Familie	Machine learning	Machine learning	Machine learning
Oprindelsesår	2000s–2010s	1990–1997	1996–2000s
Ophavsperson	Dietterich, T. G. (ensemble voting foundations); robustification extensions developed broadly in the ML community	Schapire, R. E.; Freund, Y.	Breiman, L. (bagging); robust variants developed by various authors in 2000s
Type	Robust ensemble aggregation	Sequential ensemble (iterative reweighting)	Ensemble (robust bootstrap aggregating)
Oprindelig kilde	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.	Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140.
Aliasser	robust majority voting, robust vote aggregation, noise-tolerant voting ensemble, fault-tolerant classifier combination	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	robust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGing
Relaterede	6	6	6
Resumé	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.	Robust Bagging extends the classic Bootstrap Aggregating (Bagging) framework by replacing or augmenting standard base learners with robust estimators — or by using robust aggregation rules — so that the ensemble remains accurate even when training data contain outliers, mislabelled instances, or heavy-tailed noise distributions.