ScholarGate
Assistent

Compara mètodes

Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.

Robust Bagging×Random Forest×Robust Boosting×
CampAprenentatge automàticAprenentatge automàticAprenentatge automàtic
FamíliaMachine learningMachine learningMachine learning
Any d'origen1996–2000s20011999–2001
Autor originalBreiman, L. (bagging); robust variants developed by various authors in 2000sBreiman, L.Freund, Y.; Mason, L. et al.
TipusEnsemble (robust bootstrap aggregating)Ensemble (bagging of decision trees)Ensemble (robust sequential boosting)
Font seminalBreiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗Freund, Y. (2001). An adaptive version of the boost by majority algorithm. Machine Learning, 43(3), 293–318. DOI ↗
Àliesrobust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGingRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemblenoise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting
Relacionats646
ResumRobust 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.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.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.
ScholarGateConjunt de dades
  1. v1
  2. 2 Fonts
  3. PUBLISHED
  1. v1
  2. 2 Fonts
  3. PUBLISHED
  1. v1
  2. 2 Fonts
  3. PUBLISHED

Ves a la cerca Baixa les diapositives

ScholarGateCompara mètodes: Robust Bagging · Random Forest · Robust Boosting. Recuperat el 2026-06-17 de https://scholargate.app/ca/compare