Compară metode

	Boosting	Împachetare Robustă (Robust Bagging)
Domeniu	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning
Anul apariției	1990–1997	1996–2000s
Autorul original	Schapire, R. E.; Freund, Y.	Breiman, L. (bagging); robust variants developed by various authors in 2000s
Tip	Sequential ensemble (iterative reweighting)	Ensemble (robust bootstrap aggregating)
Sursa seminală	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.
Denumiri alternative	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	robust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGing
Înrudite	6	6
Rezumat	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.