方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 动态社群侦测× | 随机块模型× | |
|---|---|---|
| 领域 | 网络分析 | 网络分析 |
| 方法族≠ | Machine learning | Process / pipeline |
| 起源年份≠ | 2010 (key formalization); earlier work 2002–2009 | 1983 |
| 提出者≠ | Mucha, P. J. et al. (key formalization); earlier work by Girvan & Newman (2002) | — |
| 类型≠ | Graph clustering / community discovery | Probabilistic generative graph model |
| 开创性文献≠ | Mucha, P. J., Richardson, T., Macon, K., Porter, M. A., & Onnela, J.-P. (2010). Community structure in time-dependent, multiscale, and multiplex networks. Science, 328(5980), 876–878. DOI ↗ | Holland, P.W., Laskey, K.B. & Leinhardt, S. (1983). Stochastic Blockmodels: First Steps. Social Networks, 5(2), 109-137. DOI ↗ |
| 别名 | DCD, temporal community detection, evolving community detection, dynamic graph clustering | SBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM) |
| 相关≠ | 5 | 7 |
| 摘要≠ | Dynamic community detection identifies groups of densely connected nodes in networks that evolve over time, tracking how communities form, merge, split, and dissolve across temporal snapshots. Developed to extend static modularity optimization to time-varying structures, it is widely used in social, biological, and communication network research. | 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. |
| ScholarGate数据集 ↗ |
|
|