השוואת שיטות

	שקית חסינה (Robust Bagging)	Boosting רובוסטי
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1996–2000s	1999–2001
הוגה השיטה	Breiman, L. (bagging); robust variants developed by various authors in 2000s	Freund, Y.; Mason, L. et al.
סוג	Ensemble (robust bootstrap aggregating)	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.
כינויים	robust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGing	noise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting
קשורות	6	6
תקציר	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.	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.