ScholarGate
Asisten

Bandingkan metode

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

Robust Bagging×Bagging (Bootstrap Aggregating)×Boosting×
BidangPembelajaran MesinPembelajaran MesinPembelajaran Mesin
KeluargaMachine learningMachine learningMachine learning
Tahun asal1996–2000s19961990–1997
PencetusBreiman, L. (bagging); robust variants developed by various authors in 2000sBreiman, L.Schapire, R. E.; Freund, Y.
TipeEnsemble (robust bootstrap aggregating)Ensemble meta-algorithm (variance reduction via bootstrap aggregation)Sequential ensemble (iterative reweighting)
Sumber perintisBreiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140. DOI ↗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 ↗
Aliasrobust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGingBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
Terkait656
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.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.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.
ScholarGateSet data
  1. v1
  2. 2 Sumber
  3. PUBLISHED
  1. v1
  2. 3 Sumber
  3. PUBLISHED
  1. v1
  2. 2 Sumber
  3. PUBLISHED

Ke halaman pencarian Unduh salindia

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