Jämför metoder

	Bagging (Bootstrap Aggregating)	Robust Boosting
Ämnesområde	Maskininlärning	Maskininlärning
Familj	Machine learning	Machine learning
Ursprungsår	1996	1999–2001
Upphovsperson	Breiman, L.	Freund, Y.; Mason, L. et al.
Typ	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Ensemble (robust sequential boosting)
Ursprungskälla	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	Freund, Y. (2001). An adaptive version of the boost by majority algorithm. Machine Learning, 43(3), 293–318.
Alias	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	noise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting
Närliggande	5	6
Sammanfattning	Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.	Robust Boosting modifies standard boosting algorithms — such as AdaBoost or gradient boosting — by replacing the default exponential or squared loss with robust loss functions (e.g., Huber, logistic, or truncated losses) or by incorporating noise-tolerance mechanisms, so that the ensemble remains accurate even when training data contain outliers, label noise, or heavy-tailed errors.