ScholarGate
Assistent

Jämför metoder

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

Gradient Boosting×Etikettpropagering×Semi-övervakad inlärning×
ÄmnesområdeMaskininlärningMaskininlärningMaskininlärning
FamiljMachine learningMachine learningMachine learning
Ursprungsår200120021970s–2006 (formalized)
UpphovspersonFriedman, J. H.Zhu, X. & Ghahramani, Z.Vapnik, V. N. and others (community of researchers, 1970s–2000s)
TypEnsemble (sequential boosting of decision trees)Graph-based semi-supervised classificationLearning paradigm
UrsprungskällaFriedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University. link ↗Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
AliasGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineLP, label spreading, graph-based semi-supervised learning, harmonic label propagationSSL, semi-supervised machine learning, transductive learning, label-efficient learning
Närliggande535
SammanfattningGradient 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.Label Propagation is a graph-based semi-supervised learning algorithm introduced by Zhu and Ghahramani in 2002 that spreads class labels from a small set of labeled nodes to a large set of unlabeled nodes by iteratively diffusing label information along the edges of a similarity graph, exploiting the manifold structure of the data.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.
ScholarGateDatamängd
  1. v1
  2. 1 Källor
  3. PUBLISHED
  1. v1
  2. 3 Källor
  3. PUBLISHED
  1. v1
  2. 2 Källor
  3. PUBLISHED

Gå till sökningen Ladda ner bildspel

ScholarGateJämför metoder: Gradient Boosting · Label Propagation · Semi-supervised Learning. Hämtad 2026-06-18 från https://scholargate.app/sv/compare