Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Boosting bayesowski× | Gradient Boosting× | |
|---|---|---|
| Dziedzina | Uczenie maszynowe | Uczenie maszynowe |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1999–2010 | 2001 |
| Twórca≠ | Ridgeway, G.; Chipman, H. A. et al. | Friedman, J. H. |
| Typ≠ | Probabilistic ensemble (Bayesian interpretation of boosting) | Ensemble (sequential boosting of decision trees) |
| Źródło pierwotne≠ | Ridgeway, G. (1999). The state of boosting. Computing Science and Statistics, 31, 172–181. link ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| Inne nazwy | Bayesian ensemble boosting, probabilistic boosting, Bayesian additive model, Bayesian boosted ensemble | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine |
| Pokrewne | 5 | 5 |
| Podsumowanie≠ | Bayesian boosting integrates probabilistic Bayesian inference with boosting ensemble techniques, combining multiple weak learners while maintaining full uncertainty quantification over predictions. Unlike standard gradient boosting that produces a single point estimate, Bayesian boosting yields a posterior distribution over the ensemble output, enabling calibrated confidence intervals alongside predictions. | Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost. |
| ScholarGateZbiór danych ↗ |
|
|