Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Динамічна стохастична блокова модель× | Аналіз модулярності× | |
|---|---|---|
| Галузь | Мережевий аналіз | Мережевий аналіз |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2011 | 2004 |
| Автор методу≠ | Yang, T.; Chi, Y.; Zhu, S.; Gong, Y.; Jin, R. | Newman, M. E. J. & Girvan, M. |
| Тип≠ | Generative probabilistic model | Community detection / graph partitioning |
| Основоположне джерело≠ | Yang, T., Chi, Y., Zhu, S., Gong, Y., & Jin, R. (2011). Detecting communities and their evolutions in dynamic social networks — a Bayesian approach. Machine Learning, 82(2), 157–189. DOI ↗ | Newman, M. E. J., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113. DOI ↗ |
| Інші назви | DSBM, dynamic SBM, time-varying stochastic block model, temporal block model | Q-modularity, community structure detection, network modularity optimization, graph partitioning by modularity |
| Пов'язані | 5 | 5 |
| Підсумок≠ | The Dynamic Stochastic Block Model (DSBM) is a generative probabilistic framework that extends the static stochastic block model to networks observed across multiple time points. It jointly models community membership and community evolution, allowing researchers to detect and track latent groups and their structural changes over time in longitudinal network data. | Modularity analysis is a network science method, formalized by Newman and Girvan in 2004, that detects community structure in graphs by measuring whether edges are more concentrated within groups than expected by chance. Its scalar quality index Q guides algorithms that partition nodes into cohesive clusters, making it the most widely adopted framework for community detection in social, biological, and technological networks. |
| ScholarGateНабір даних ↗ |
|
|