ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

Ensemble Gradient Boosting×AdaBoost×LightGBM×
분야머신러닝머신러닝머신러닝
계열Machine learningMachine learningMachine learning
기원 연도200119972017
창시자Friedman, J. H.Freund, Y. & Schapire, R.E.Ke, G. et al. (Microsoft)
유형Ensemble (sequential boosting of decision trees)Ensemble (sequential boosting of weak learners)Gradient boosting decision tree ensemble
원전Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗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. DOI ↗Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q. & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems (NeurIPS) 30, 3146–3154. link ↗
별칭Gradient Boosting Machine, GBM, Gradient Tree Boosting, Stochastic Gradient BoostingAdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırmaLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting
관련655
요약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.AdaBoost (Adaptive Boosting) is the original boosting algorithm, introduced by Yoav Freund and Robert Schapire in 1997, that combines a sequence of simple weak learners by giving more weight to the observations they get wrong. The forerunner of gradient boosting, it is simple, interpretable, and a strong baseline for classification.LightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Ensemble Gradient Boosting · AdaBoost · LightGBM. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare