ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

التعبئة القوية (Robust Bagging)×التعزيز×تعزيز قوي×
المجالتعلم الآلةتعلم الآلةتعلم الآلة
العائلةMachine learningMachine learningMachine learning
سنة النشأة1996–2000s1990–19971999–2001
صاحب الطريقةBreiman, L. (bagging); robust variants developed by various authors in 2000sSchapire, R. E.; Freund, Y.Freund, Y.; Mason, L. et al.
النوعEnsemble (robust bootstrap aggregating)Sequential ensemble (iterative reweighting)Ensemble (robust sequential boosting)
المصدر التأسيسيBreiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140. DOI ↗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. DOI ↗Freund, Y. (2001). An adaptive version of the boost by majority algorithm. Machine Learning, 43(3), 293–318. DOI ↗
الأسماء البديلةrobust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGingAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemblenoise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting
ذات صلة666
الملخص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.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 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.
ScholarGateمجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Robust Bagging · Boosting · Robust Boosting. استُرجع بتاريخ 2026-06-17 من https://scholargate.app/ar/compare