Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Robust Boosting× | Boosting× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1999–2001 | 1990–1997 |
| Upphovsperson≠ | Freund, Y.; Mason, L. et al. | Schapire, R. E.; Freund, Y. |
| Typ≠ | Ensemble (robust sequential boosting) | Sequential ensemble (iterative reweighting) |
| Ursprungskälla≠ | Freund, Y. (2001). An adaptive version of the boost by majority algorithm. Machine Learning, 43(3), 293–318. 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 | noise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble |
| Närliggande | 6 | 6 |
| Sammanfattning≠ | 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. | 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. |
| ScholarGateDatamängd ↗ |
|
|