Vertaile menetelmiä
Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.
| [UNTRANSLATED: Bayesian Random Forest...]× | Gradient Boosting× | |
|---|---|---|
| Tieteenala | Koneoppiminen | Koneoppiminen |
| Menetelmäperhe | Machine learning | Machine learning |
| Syntyvuosi≠ | 2015 | 2001 |
| Kehittäjä≠ | Taddy, M. et al. | Friedman, J. H. |
| Tyyppi≠ | Bayesian ensemble of decision trees | Ensemble (sequential boosting of decision trees) |
| Alkuperäislähde≠ | Taddy, M., Chen, C., Yu, J., & Wyle, M. (2015). Bayesian and Empirical Bayesian Forests. Proceedings of the 32nd International Conference on Machine Learning (ICML 2015), PMLR 37, 967–976. link ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| Rinnakkaisnimet | Bayesian Forest, BRF, Empirical Bayesian Forest, posterior random forest | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine |
| Liittyvät | 5 | 5 |
| Tiivistelmä≠ | Bayesian Random Forest extends the classical random forest by placing a prior distribution over tree structures and leaf parameters, then sampling or approximating the posterior over that ensemble. The result is a set of predictions accompanied by calibrated uncertainty estimates — a capability standard random forests lack — making it valuable when knowing how confident the model is matters as much as the prediction itself. | 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. |
| ScholarGateAineisto ↗ |
|
|