Porównaj metody

	Bayesian Random Forest	Gradient Boosting
Dziedzina	Uczenie maszynowe	Uczenie maszynowe
Rodzina	Machine learning	Machine learning
Rok powstania	2015	2001
Twórca	Taddy, M. et al.	Friedman, J. H.
Typ	Bayesian ensemble of decision trees	Ensemble (sequential boosting of decision trees)
Źródło pierwotne	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.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.
Inne nazwy	Bayesian Forest, BRF, Empirical Bayesian Forest, posterior random forest	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Pokrewne	5	5
Podsumowanie	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.