השוואת שיטות

	מודל הבלוקים הסטוכסטי (SBM)	DBSCAN
תחום	ניתוח רשתות	למידת מכונה
משפחה	Process / pipeline	Machine learning
שנת המקור	1983	1996
הוגה השיטה	—	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.
סוג	Probabilistic generative graph model	Density-based clustering algorithm
מקור מכונן	Holland, P.W., Laskey, K.B. & Leinhardt, S. (1983). Stochastic Blockmodels: First Steps. Social Networks, 5(2), 109-137.	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231.
כינויים	SBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM)	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering
קשורות	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.	DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.