ScholarGate
Asisten

Bandingkan metode

Tinjau metode pilihan Anda berdampingan; baris yang berbeda akan disorot.

Robust Bagging×Boosting×Robust Boosting×
BidangPembelajaran MesinPembelajaran MesinPembelajaran Mesin
KeluargaMachine learningMachine learningMachine learning
Tahun asal1996–2000s1990–19971999–2001
PencetusBreiman, L. (bagging); robust variants developed by various authors in 2000sSchapire, R. E.; Freund, Y.Freund, Y.; Mason, L. et al.
TipeEnsemble (robust bootstrap aggregating)Sequential ensemble (iterative reweighting)Ensemble (robust sequential boosting)
Sumber perintisBreiman, 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 ↗
Aliasrobust 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
Terkait666
RingkasanRobust 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.
ScholarGateSet data
  1. v1
  2. 2 Sumber
  3. PUBLISHED
  1. v1
  2. 2 Sumber
  3. PUBLISHED
  1. v1
  2. 2 Sumber
  3. PUBLISHED

Ke halaman pencarian Unduh salindia

ScholarGateBandingkan metode: Robust Bagging · Boosting · Robust Boosting. Diakses 2026-06-17 dari https://scholargate.app/id/compare