Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Χρονική Ενδιάμεση Κεντρικότητα× | Ανάλυση Διάχυσης σε Χρονικά Δίκτυα× | |
|---|---|---|
| Πεδίο | Ανάλυση Δικτύων | Ανάλυση Δικτύων |
| Οικογένεια | Machine learning | Machine learning |
| Έτος προέλευσης | 2012 | 2012 |
| Δημιουργός≠ | Kim, H. & Anderson, R.; Holme, P. & Saramäki, J. | Holme, P. & Saramäki, J. |
| Τύπος≠ | Centrality measure for temporal networks | Network analysis framework |
| Θεμελιώδης πηγή≠ | Holme, P., & Saramäki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ | Holme, P. & Saramäki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ |
| Εναλλακτικές ονομασίες | TBC, time-varying betweenness centrality, dynamic betweenness centrality, time-respecting betweenness | TNDA, dynamic network diffusion, time-varying network spreading, diffusion on temporal networks |
| Συναφείς≠ | 6 | 5 |
| Σύνοψη≠ | 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. | Temporal Network Diffusion Analysis studies how information, disease, influence, or other contagions spread through networks whose structure changes over time. By modeling edges as time-stamped contacts rather than static links, it captures the critical role of timing and ordering in determining which nodes get reached, how fast, and through which pathways — producing conclusions that static network models systematically miss. |
| ScholarGateΣύνολο δεδομένων ↗ |
|
|