方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 动态社群侦测× | 时间网络分析× | |
|---|---|---|
| 领域 | 网络分析 | 网络分析 |
| 方法族≠ | Machine learning | Process / pipeline |
| 起源年份≠ | 2010 (key formalization); earlier work 2002–2009 | 2012 |
| 提出者≠ | Mucha, P. J. et al. (key formalization); earlier work by Girvan & Newman (2002) | Holme & Saramäki (2012) — seminal framework |
| 类型≠ | Graph clustering / community discovery | Dynamic graph analysis |
| 开创性文献≠ | 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 ↗ | Holme, P. & Saramäki, J. (2012). Temporal Networks. Physics Reports, 519(3), 97-125. DOI ↗ |
| 别名≠ | DCD, temporal community detection, evolving community detection, dynamic graph clustering | dynamic network analysis, time-varying network analysis, Zamansal Ağ Analizi (Temporal / Dynamic Networks) |
| 相关≠ | 5 | 3 |
| 摘要≠ | 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. | Temporal network analysis, formalised by Holme and Saramäki in their landmark 2012 Physics Reports survey, is the study of networks in which edges appear and disappear over time. Rather than collapsing all contacts into a single static graph, the approach preserves the precise timing of interactions — whether as contact sequences, time-stamped event lists, or windowed snapshots — and uses that timing to track how influence, disease, or information can actually propagate through the system. |
| ScholarGate数据集 ↗ |
|
|