পদ্ধতির তুলনা করুন

	স্টোকাস্টিক ব্লক মডেল	ডিবিস্ক্যান
ক্ষেত্র	নেটওয়ার্ক বিশ্লেষণ	যন্ত্র শিখন
পরিবার	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.