השוואת שיטות

	אלגוריתם התפשטות התוויות (Label Propagation)	אשכול ספקטרלי
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	2002	2002
הוגה השיטה	Zhu, X. & Ghahramani, Z.	Ng, A. Y.; Jordan, M. I.; Weiss, Y.
סוג	Graph-based semi-supervised classification	Graph-based clustering (spectral method)
מקור מכונן	Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University.	Ng, A. Y., Jordan, M. I., & Weiss, Y. (2002). On Spectral Clustering: Analysis and an Algorithm. Advances in Neural Information Processing Systems, 14, 849–856.
כינויים	LP, label spreading, graph-based semi-supervised learning, harmonic label propagation	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering
קשורות	3	5
תקציר	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.	Spectral Clustering is a graph-based unsupervised learning algorithm, formalized by Ng, Jordan, and Weiss in 2002, that maps data points into a low-dimensional eigenspace derived from the similarity graph's Laplacian before applying k-means. This spectral embedding makes it possible to recover clusters of arbitrary shape — rings, crescents, interleaved spirals — that Euclidean distance-based methods consistently fail to separate.