השוואת שיטות

	אלגוריתם התפשטות התוויות (Label Propagation)	יער אקראי
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	2002	2001
הוגה השיטה	Zhu, X. & Ghahramani, Z.	Breiman, L.
סוג	Graph-based semi-supervised classification	Ensemble (bagging of decision trees)
מקור מכונן	Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
כינויים	LP, label spreading, graph-based semi-supervised learning, harmonic label propagation	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
קשורות	3	4
תקציר	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.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.