Comparar métodos
Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.
| Empaquetado Robusto× | Potenciación× | |
|---|---|---|
| Campo | Aprendizaje automático | Aprendizaje automático |
| Familia | Machine learning | Machine learning |
| Año de origen≠ | 1996–2000s | 1990–1997 |
| Autor original≠ | Breiman, L. (bagging); robust variants developed by various authors in 2000s | Schapire, R. E.; Freund, Y. |
| Tipo≠ | Ensemble (robust bootstrap aggregating) | Sequential ensemble (iterative reweighting) |
| Fuente seminal≠ | 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 ↗ |
| Alias | robust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGing | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble |
| Relacionados | 6 | 6 |
| Resumen≠ | 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. |
| ScholarGateConjunto de datos ↗ |
|
|