Compară metode

	Boosting Bayesian	XGBoost
Domeniu	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning
Anul apariției	1999–2010	2016
Autorul original	Ridgeway, G.; Chipman, H. A. et al.	Chen, T. & Guestrin, C.
Tip	Probabilistic ensemble (Bayesian interpretation of boosting)	Ensemble (gradient-boosted decision trees)
Sursa seminală	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.
Denumiri alternative	Bayesian ensemble boosting, probabilistic boosting, Bayesian additive model, Bayesian boosted ensemble	XGBoost, extreme gradient boosting, scalable tree boosting
Înrudite	5	5
Rezumat	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.