विधियों की तुलना करें

	अर्ध-पर्यवेक्षित कैटबूस्ट	ग्रेडिएंट बूस्टिंग
क्षेत्र	मशीन अधिगम	मशीन अधिगम
परिवार	Machine learning	Machine learning
उद्भव वर्ष	2018 (CatBoost); semi-supervised learning framework predates 2006	2001
प्रवर्तक	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.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.
उपनाम	SSL CatBoost, semi-supervised gradient boosting with CatBoost, CatBoost with unlabeled data, pseudo-label CatBoost	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
संबंधित	5	5
सारांश	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.