Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Dynamisk gradcentralitet× | Dynamisk gemenskapsdetektering× | |
|---|---|---|
| Ämnesområde | Nätverksanalys | Nätverksanalys |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2012 | 2010 (key formalization); earlier work 2002–2009 |
| Upphovsperson≠ | Holme, P. & Saramaki, J.; Kim, H. & Anderson, R. | Mucha, P. J. et al. (key formalization); earlier work by Girvan & Newman (2002) |
| Typ≠ | Centrality measure (temporal extension) | Graph clustering / community discovery |
| Ursprungskälla≠ | Holme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ | 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 ↗ |
| Alias | time-varying degree centrality, temporal degree centrality, evolving degree centrality, DDC | DCD, temporal community detection, evolving community detection, dynamic graph clustering |
| Närliggande | 5 | 5 |
| Sammanfattning≠ | Dynamic degree centrality extends the classical degree centrality measure to networks that change over time. Rather than counting a node's connections in a single static snapshot, it tracks how many contacts each node maintains across successive time windows or contact events, producing a time-resolved importance profile for every actor in the network. | 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. |
| ScholarGateDatamängd ↗ |
|
|