ScholarGate
Ассистент

Сравнение методов

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

Полуавтоматический CatBoost×Градиентный бустинг×
ОбластьМашинное обучениеМашинное обучение
СемействоMachine learningMachine learning
Год появления2018 (CatBoost); semi-supervised learning framework predates 20062001
Автор методаProkhorenkova et al. (CatBoost); semi-supervised paradigm from Chapelle et al.Friedman, J. H.
ТипSemi-supervised ensemble (gradient boosting)Ensemble (sequential boosting of decision trees)
Основополагающий источникProkhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A. V., & Gulin, A. (2018). CatBoost: unbiased boosting with categorical features. In Advances in Neural Information Processing Systems (NeurIPS), 31. link ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗
Другие названияSSL CatBoost, semi-supervised gradient boosting with CatBoost, CatBoost with unlabeled data, pseudo-label CatBoostGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Связанные55
СводкаSemi-supervised CatBoost applies CatBoost's ordered gradient boosting framework to settings where only a fraction of training instances carry labels, leveraging unlabeled data through pseudo-labeling or consistency-based strategies to improve model accuracy beyond what labeled data alone would allow.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.
ScholarGateНабор данных
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 1 Источники
  3. PUBLISHED

Перейти к поиску Скачать слайды

ScholarGateСравнение методов: Semi-supervised CatBoost · Gradient Boosting. Получено 2026-06-17 из https://scholargate.app/ru/compare