Usporedite metode

	CatBoost	Stablo odlučivanja
Područje	Strojno učenje	Strojno učenje
Obitelj	Machine learning	Machine learning
Godina nastanka	2018	1984
Tvorac	Prokhorenkova, L. et al. (Yandex)	Breiman, Friedman, Olshen & Stone
Vrsta	Gradient boosting on decision trees	Recursive partitioning (if-then rules)
Temeljni izvor	Prokhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A.V. & Gulin, A. (2018). CatBoost: Unbiased Boosting with Categorical Features. In NeurIPS 2018.	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.
Drugi nazivi	CatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırma	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree
Srodne	5	5
Sažetak	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.