ScholarGate
सहायक

विधियों की तुलना करें

चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।

CatBoost×ह्यूबर रिग्रेशन×लाइटजीबीएम×
क्षेत्रमशीन अधिगमसांख्यिकीमशीन अधिगम
परिवारMachine learningRegression modelMachine learning
उद्भव वर्ष201819642017
प्रवर्तकProkhorenkova, L. et al. (Yandex)Peter J. HuberKe, G. et al. (Microsoft)
प्रकारGradient boosting on decision treesRobust linear regression (M-estimation)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 ↗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 ↗
उपनामCatBoost (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
संबंधित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.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.
ScholarGateडेटासेट
  1. v1
  2. 1 स्रोत
  3. PUBLISHED
  1. v1
  2. 2 स्रोत
  3. PUBLISHED
  1. v1
  2. 1 स्रोत
  3. PUBLISHED

खोज पर जाएँ स्लाइड डाउनलोड करें

ScholarGateविधियों की तुलना करें: CatBoost · Huber Regression · LightGBM. 2026-06-18 को यहाँ से प्राप्त https://scholargate.app/hi/compare