Porovnať metódy
Prezrite si vybrané metódy vedľa seba; riadky, ktoré sa líšia, sú zvýraznené.
| CatBoost× | Rozhodovací strom× | |
|---|---|---|
| Odbor | Strojové učenie | Strojové učenie |
| Rodina | Machine learning | Machine learning |
| Rok vzniku≠ | 2018 | 1984 |
| Tvorca≠ | Prokhorenkova, L. et al. (Yandex) | Breiman, Friedman, Olshen & Stone |
| Typ≠ | Gradient boosting on decision trees | Recursive partitioning (if-then rules) |
| Pôvodný zdroj≠ | Prokhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A.V. & Gulin, A. (2018). CatBoost: Unbiased Boosting with Categorical Features. In NeurIPS 2018. DOI ↗ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ |
| Ďalšie názvy≠ | CatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırma | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree |
| Príbuzné | 5 | 5 |
| Zhrnutie≠ | 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. | A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf. |
| ScholarGateDátová sada ↗ |
|
|