ScholarGate
Assistent

Jämför metoder

Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.

CatBoost×XGBoost×
ÄmnesområdeMaskininlärningMaskininlärning
FamiljMachine learningMachine learning
Ursprungsår20182016
UpphovspersonProkhorenkova, L. et al. (Yandex)Chen, T. & Guestrin, C.
TypGradient boosting on decision treesEnsemble (gradient-boosted decision trees)
UrsprungskällaProkhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A.V. & Gulin, A. (2018). CatBoost: Unbiased Boosting with Categorical Features. In NeurIPS 2018. DOI ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
AliasCatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırmaXGBoost, extreme gradient boosting, scalable tree boosting
Närliggande55
SammanfattningCatBoost 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.XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.
ScholarGateDatamängd
  1. v1
  2. 1 Källor
  3. PUBLISHED
  1. v1
  2. 1 Källor
  3. PUBLISHED

Gå till sökningen Ladda ner bildspel

ScholarGateJämför metoder: CatBoost · XGBoost. Hämtad 2026-06-17 från https://scholargate.app/sv/compare