পদ্ধতির তুলনা করুন

	বেয়েশীয় বুস্টিং	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.