Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Temporal Eigenvector Centrality× | Temporal mellanliggande centralitet× | |
|---|---|---|
| Ämnesområde | Nätverksanalys | Nätverksanalys |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2011-2017 | 2012 |
| Upphovsperson≠ | Grindrod, P.; Higham, D. J.; Taylor, D. et al. | Kim, H. & Anderson, R.; Holme, P. & Saramäki, J. |
| Typ | Centrality measure for temporal networks | Centrality measure for temporal networks |
| Ursprungskälla≠ | Grindrod, P., Parsons, M. C., Higham, D. J., & Estrada, E. (2011). Communicability across evolving networks. Physical Review E, 83(4), 046120. DOI ↗ | Holme, P., & Saramäki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ |
| Alias | dynamic eigenvector centrality, time-varying eigenvector centrality, TEC, temporal communicability centrality | TBC, time-varying betweenness centrality, dynamic betweenness centrality, time-respecting betweenness |
| Närliggande≠ | 5 | 6 |
| Sammanfattning≠ | Temporal eigenvector centrality extends the classical eigenvector centrality to networks that change over time. By accounting for the ordering and timing of connections, it identifies nodes that are influential not merely because of many simultaneous connections, but because they sit at the crossroads of sequentially important pathways across multiple time slices of the network. | Temporal Betweenness Centrality (TBC) extends classical betweenness centrality to time-stamped networks by counting how often a node lies on time-respecting shortest paths — paths that traverse edges in chronological order. It identifies nodes that act as temporal brokers, controlling information or resource flow as it evolves over time, rather than in a static snapshot. |
| ScholarGateDatamängd ↗ |
|
|