השוואת שיטות

	מודל הבלוקים הסטוכסטי (SBM)	ניתוח רכיבים עיקריים
תחום	ניתוח רשתות	למידת מכונה
משפחה	Process / pipeline	Machine learning
שנת המקור	1983	2002
הוגה השיטה	—	Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
סוג	Probabilistic generative graph model	Unsupervised dimensionality reduction
מקור מכונן	Holland, P.W., Laskey, K.B. & Leinhardt, S. (1983). Stochastic Blockmodels: First Steps. Social Networks, 5(2), 109-137.	Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer.
כינויים	SBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM)	Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
קשורות	7	3
תקציר	The Stochastic Block Model (SBM), introduced by Holland, Laskey and Leinhardt (1983), is a probabilistic generative model for graphs that assigns nodes to latent blocks and parametrically estimates the connection probabilities between blocks. It is the foundational approach for community detection, core-periphery identification, and hierarchical structure discovery in network analysis.	Principal Component Analysis (PCA) is an unsupervised dimensionality-reduction method — given its modern textbook treatment by Ian Jolliffe (2002) — that compresses high-dimensional data into fewer dimensions while preserving the maximum possible variance. It re-expresses correlated variables as a small set of uncorrelated principal components ordered by how much of the data's variation each one captures.