विधियों की तुलना करें

	बैगिंग (बूटस्ट्रैप एग्रीगेटिंग)	Robust Boosting
क्षेत्र	मशीन अधिगम	मशीन अधिगम
परिवार	Machine learning	Machine learning
उद्भव वर्ष	1996	1999–2001
प्रवर्तक	Breiman, L.	Freund, Y.; Mason, L. et al.
प्रकार	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Ensemble (robust sequential boosting)
मौलिक स्रोत	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.
उपनाम	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	noise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting
संबंधित	5	6
सारांश	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.