ScholarGate
Assistent

Sammenlign metoder

Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.

CatBoost×Beslutningstræ×Random Forest×
FagområdeMaskinlæringMaskinlæringMaskinlæring
FamilieMachine learningMachine learningMachine learning
Oprindelsesår201819842001
OphavspersonProkhorenkova, L. et al. (Yandex)Breiman, Friedman, Olshen & StoneBreiman, L.
TypeGradient boosting on decision treesRecursive partitioning (if-then rules)Ensemble (bagging of decision trees)
Oprindelig kildeProkhorenkova, 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 ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
AliasserCatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırmaKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Relaterede554
Resumé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.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.
ScholarGateDatasæt
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 2 Kilder
  3. PUBLISHED

Gå til søgning Hent slides

ScholarGateSammenlign metoder: CatBoost · Decision Tree · Random Forest. Hentet 2026-06-18 fra https://scholargate.app/da/compare