ScholarGate
Asistent

Uporedite metode

Pregledajte izabrane metode jednu pored druge; redovi koji se razlikuju su istaknuti.

Robust Bagging×Boosting×Robusni Būsting×
OblastMašinsko učenjeMašinsko učenjeMašinsko učenje
PorodicaMachine learningMachine learningMachine learning
Godina nastanka1996–2000s1990–19971999–2001
TvoracBreiman, L. (bagging); robust variants developed by various authors in 2000sSchapire, R. E.; Freund, Y.Freund, Y.; Mason, L. et al.
TipEnsemble (robust bootstrap aggregating)Sequential ensemble (iterative reweighting)Ensemble (robust sequential boosting)
Temeljni izvorBreiman, 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 ↗
Drugi nazivirobust 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
Srodne666
SažetakRobust 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.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretragu Preuzmi slajdove

ScholarGateUporedite metode: Robust Bagging · Boosting · Robust Boosting. Preuzeto 2026-06-17 sa https://scholargate.app/sr/compare