विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| रेगुलराइज़्ड लाइटजीबीएम (Regularized LightGBM)× | CatBoost× | लाइटजीबीएम× | |
|---|---|---|---|
| क्षेत्र | मशीन अधिगम | मशीन अधिगम | मशीन अधिगम |
| परिवार | Machine learning | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 2017 | 2018 | 2017 |
| प्रवर्तक≠ | Ke, G. et al. (Microsoft Research) | Prokhorenkova, L. et al. (Yandex) | Ke, G. et al. (Microsoft) |
| प्रकार≠ | Regularized gradient boosting ensemble | Gradient boosting on decision trees | Gradient boosting decision tree ensemble |
| मौलिक स्रोत≠ | 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, 30, 3146–3154. link ↗ | Prokhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A.V. & Gulin, A. (2018). CatBoost: Unbiased Boosting with Categorical Features. In NeurIPS 2018. 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 ↗ |
| उपनाम | LightGBM with L1/L2 regularization, penalized LightGBM, LightGBM ridge/lasso, regularized LGBM | CatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırma | LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting |
| संबंधित | 5 | 5 | 5 |
| सारांश≠ | Regularized LightGBM applies L1 (lasso) and L2 (ridge) penalty terms to the leaf weight objective of LightGBM — Microsoft's highly efficient gradient boosting framework — to control model complexity, reduce overfitting, and improve generalization on tabular classification and regression tasks with high-dimensional or noisy feature sets. | 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. | 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डेटासेट ↗ |
|
|
|