방법 비교

	베이지안 부스팅	XGBoost
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1999–2010	2016
창시자	Ridgeway, G.; Chipman, H. A. et al.	Chen, T. & Guestrin, C.
유형	Probabilistic ensemble (Bayesian interpretation of boosting)	Ensemble (gradient-boosted decision trees)
원전	Ridgeway, G. (1999). The state of boosting. Computing Science and Statistics, 31, 172–181.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
별칭	Bayesian ensemble boosting, probabilistic boosting, Bayesian additive model, Bayesian boosted ensemble	XGBoost, extreme gradient boosting, scalable tree boosting
관련	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.	XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.