Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Стохастична блокова модель× | 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. DOI ↗ | 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. link ↗ |
| Інші назви≠ | 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. |
| ScholarGateНабір даних ↗ |
|
|