방법 비교

	부스팅	XGBoost
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1990–1997	2016
창시자	Schapire, R. E.; Freund, Y.	Chen, T. & Guestrin, C.
유형	Sequential ensemble (iterative reweighting)	Ensemble (gradient-boosted decision trees)
원전	Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
별칭	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	XGBoost, extreme gradient boosting, scalable tree boosting
관련	6	5
요약	Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.	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.