ScholarGate
Assistent

Methoden vergelijken

Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.

Semi-supervised Boosting×Gradient Boosting×
VakgebiedMachine learningMachine learning
FamilieMachine learningMachine learning
Jaar van ontstaan1999–20092001
GrondleggerMallapragada, P. K.; Bennett, K. P.; and othersFriedman, J. H.
TypeSemi-supervised ensemble methodEnsemble (sequential boosting of decision trees)
Oorspronkelijke bronMallapragada, 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 ↗
AliassenSemiBoost, SSL boosting, boosting with unlabeled data, semi-supervised ensemble boostingGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Verwant55
SamenvattingSemi-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.
ScholarGateGegevensset
  1. v1
  2. 2 Bronnen
  3. PUBLISHED
  1. v1
  2. 1 Bronnen
  3. PUBLISHED

Naar zoeken Dia's downloaden

ScholarGateMethoden vergelijken: Semi-supervised Boosting · Gradient Boosting. Geraadpleegd op 2026-06-17 via https://scholargate.app/nl/compare