ScholarGate
Assistent

Sammenlign metoder

Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.

CatBoost×Beslutningstre×Gradient Boosting×
FagfeltMaskinlæringMaskinlæringMaskinlæring
FamilieMachine learningMachine learningMachine learning
Opprinnelsesår201819842001
OpphavspersonProkhorenkova, L. et al. (Yandex)Breiman, Friedman, Olshen & StoneFriedman, J. H.
TypeGradient boosting on decision treesRecursive partitioning (if-then rules)Ensemble (sequential boosting of decision trees)
Opprinnelig 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 ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗
AliasCatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırmaKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Relaterte555
SammendragCatBoost 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.Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.
ScholarGateDatasett
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED

Gå til søk Last ned lysbilder

ScholarGateSammenlign metoder: CatBoost · Decision Tree · Gradient Boosting. Hentet 2026-06-18 fra https://scholargate.app/no/compare