เปรียบเทียบวิธี

	Bayesian Boosting	Random Forest แบบเบย์เซียน	การเสริมกำลังไล่ระดับ
สาขาวิชา	การเรียนรู้ของเครื่อง	การเรียนรู้ของเครื่อง	การเรียนรู้ของเครื่อง
ตระกูล	Machine learning	Machine learning	Machine learning
ปีกำเนิด	1999–2010	2015	2001
ผู้ริเริ่ม	Ridgeway, G.; Chipman, H. A. et al.	Taddy, M. et al.	Friedman, J. H.
ประเภท	Probabilistic ensemble (Bayesian interpretation of boosting)	Bayesian ensemble of decision trees	Ensemble (sequential boosting of decision trees)
แหล่งต้นตำรับ	Ridgeway, G. (1999). The state of boosting. Computing Science and Statistics, 31, 172–181.	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.
ชื่อเรียกอื่น	Bayesian ensemble boosting, probabilistic boosting, Bayesian additive model, Bayesian boosted ensemble	Bayesian Forest, BRF, Empirical Bayesian Forest, posterior random forest	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
ที่เกี่ยวข้อง	5	5	5
สรุป	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.	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.