ScholarGate
Asisten

Bandingkan metode

Tinjau metode pilihan Anda berdampingan; baris yang berbeda akan disorot.

CatBoost×Regresi Huber×LightGBM×
BidangPembelajaran MesinStatistikaPembelajaran Mesin
KeluargaMachine learningRegression modelMachine learning
Tahun asal201819642017
PencetusProkhorenkova, L. et al. (Yandex)Peter J. HuberKe, G. et al. (Microsoft)
TipeGradient boosting on decision treesRobust linear regression (M-estimation)Gradient boosting decision tree ensemble
Sumber perintisProkhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A.V. & Gulin, A. (2018). CatBoost: Unbiased Boosting with Categorical Features. In NeurIPS 2018. DOI ↗Huber, P. J. (1964). Robust Estimation of a Location Parameter. Annals of Mathematical Statistics, 35(1), 73-101. 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 ↗
AliasCatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırmaHuber M-estimator, Huber loss regression, robust regression, Huber RegresyonuLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting
Terkait555
RingkasanCatBoost 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.Huber regression is a robust linear regression method, introduced by Peter J. Huber in 1964, that resists the influence of outliers by treating small and large residuals differently. It applies a squared (OLS-like) loss to small residuals and a milder absolute-value loss to large ones, so extreme observations cannot dominate the fit.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.
ScholarGateSet data
  1. v1
  2. 1 Sumber
  3. PUBLISHED
  1. v1
  2. 2 Sumber
  3. PUBLISHED
  1. v1
  2. 1 Sumber
  3. PUBLISHED

Ke halaman pencarian Unduh salindia

ScholarGateBandingkan metode: CatBoost · Huber Regression · LightGBM. Diakses 2026-06-18 dari https://scholargate.app/id/compare