방법 비교

	Ensemble Gradient Boosting	XGBoost
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2001	2016
창시자	Friedman, J. H.	Chen, T. & Guestrin, C.
유형	Ensemble (sequential boosting of decision trees)	Ensemble (gradient-boosted decision trees)
원전	Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
별칭	Gradient Boosting Machine, GBM, Gradient Tree Boosting, Stochastic Gradient Boosting	XGBoost, extreme gradient boosting, scalable tree boosting
관련	6	5
요약	Gradient Boosting is an ensemble method introduced by Jerome Friedman in 2001 that builds a strong predictive model by sequentially adding shallow decision trees, each correcting the errors of the previous ensemble. By framing the problem as gradient descent in function space, it achieves state-of-the-art accuracy on classification, regression, and ranking tasks across tabular data.	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.