ScholarGate
Асистент

Порівняння методів

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

Напівкероване бустування×Градiєнтний бустинг×Напівкероване навчання×
ГалузьМашинне навчанняМашинне навчанняМашинне навчання
РодинаMachine learningMachine learningMachine learning
Рік появи1999–200920011970s–2006 (formalized)
Автор методуMallapragada, P. K.; Bennett, K. P.; and othersFriedman, J. H.Vapnik, V. N. and others (community of researchers, 1970s–2000s)
ТипSemi-supervised ensemble methodEnsemble (sequential boosting of decision trees)Learning paradigm
Основоположне джерелоMallapragada, P. K., Jin, R., Jain, A. K., & Liu, Y. (2009). SemiBoost: Boosting for Semi-supervised Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(11), 2000–2014. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
Інші назвиSemiBoost, SSL boosting, boosting with unlabeled data, semi-supervised ensemble boostingGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineSSL, semi-supervised machine learning, transductive learning, label-efficient learning
Пов'язані555
ПідсумокSemi-supervised Boosting is an ensemble learning paradigm that extends classical boosting algorithms — such as AdaBoost — to exploit both labeled and unlabeled data. By propagating label information through a similarity structure over unlabeled instances, it trains stronger classifiers than supervised boosting alone when labeled data are scarce.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.Semi-supervised learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained.
ScholarGateНабір даних
  1. v1
  2. 2 Джерела
  3. PUBLISHED
  1. v1
  2. 1 Джерела
  3. PUBLISHED
  1. v1
  2. 2 Джерела
  3. PUBLISHED

Перейти до пошуку Завантажити слайди

ScholarGateПорівняння методів: Semi-supervised Boosting · Gradient Boosting · Semi-supervised Learning. Отримано 2026-06-18 з https://scholargate.app/uk/compare