השוואת שיטות

	בוסטינג בייסיאני	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.