השוואת שיטות

	גרדיאנט בוסטינג	אלגוריתם התפשטות התוויות (Label Propagation)
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	2001	2002
הוגה השיטה	Friedman, J. H.	Zhu, X. & Ghahramani, Z.
סוג	Ensemble (sequential boosting of decision trees)	Graph-based semi-supervised classification
מקור מכונן	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.	Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University.
כינויים	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	LP, label spreading, graph-based semi-supervised learning, harmonic label propagation
קשורות	5	3
תקציר	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.	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.