Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| CatBoost× | Regularized LightGBM× | |
|---|---|---|
| Dziedzina | Uczenie maszynowe | Uczenie maszynowe |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 2018 | 2017 |
| Twórca≠ | Prokhorenkova, L. et al. (Yandex) | Ke, G. et al. (Microsoft Research) |
| Typ≠ | Gradient boosting on decision trees | Regularized gradient boosting ensemble |
| Źródło pierwotne≠ | 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, 30, 3146–3154. link ↗ |
| Inne nazwy | CatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırma | LightGBM with L1/L2 regularization, penalized LightGBM, LightGBM ridge/lasso, regularized LGBM |
| Pokrewne | 5 | 5 |
| Podsumowanie≠ | 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. | 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. |
| ScholarGateZbiór danych ↗ |
|
|