ScholarGate
어시스턴트

방법 비교

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

CatBoost×그래디언트 부스팅×LightGBM×
분야머신러닝머신러닝머신러닝
계열Machine learningMachine learningMachine learning
기원 연도201820012017
창시자Prokhorenkova, L. et al. (Yandex)Friedman, J. H.Ke, G. et al. (Microsoft)
유형Gradient boosting on decision treesEnsemble (sequential boosting of decision trees)Gradient boosting decision tree ensemble
원전Prokhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A.V. & Gulin, A. (2018). CatBoost: Unbiased Boosting with Categorical Features. In NeurIPS 2018. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. 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 ↗
별칭CatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırmaGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting
관련555
요약CatBoost is a gradient boosting algorithm, introduced by Prokhorenkova and colleagues at Yandex in 2018, that handles categorical variables natively and uses ordered target encoding to avoid label leakage. By building an additive ensemble of trees while permuting the data order at each iteration, it is often superior to XGBoost and LightGBM on category-heavy data.Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.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. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

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

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