ScholarGate
Asistent

Uporedite metode

Pregledajte izabrane metode jednu pored druge; redovi koji se razlikuju su istaknuti.

Градијентно појачање×Propagacija oznaka×
OblastMašinsko učenjeMašinsko učenje
PorodicaMachine learningMachine learning
Godina nastanka20012002
TvoracFriedman, J. H.Zhu, X. & Ghahramani, Z.
TipEnsemble (sequential boosting of decision trees)Graph-based semi-supervised classification
Temeljni izvorFriedman, 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 ↗
Drugi naziviGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineLP, label spreading, graph-based semi-supervised learning, harmonic label propagation
Srodne53
SažetakGradient 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.
ScholarGateSkup podataka
  1. v1
  2. 1 Izvori
  3. PUBLISHED
  1. v1
  2. 3 Izvori
  3. PUBLISHED

Idi na pretragu Preuzmi slajdove

ScholarGateUporedite metode: Gradient Boosting · Label Propagation. Preuzeto 2026-06-18 sa https://scholargate.app/sr/compare