Methoden vergelijken
Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.
| Temporele Nabijheid Centraliteit× | Temporale Betweenness Centraliteit× | |
|---|---|---|
| Vakgebied | Netwerkanalyse | Netwerkanalyse |
| Familie | Machine learning | Machine learning |
| Jaar van ontstaan≠ | 2011 | 2012 |
| Grondlegger≠ | Pan, R. K. & Saramaki, J. | Kim, H. & Anderson, R.; Holme, P. & Saramäki, J. |
| Type≠ | Centrality measure (temporal) | Centrality measure for temporal networks |
| Oorspronkelijke bron≠ | Pan, R. K., & Saramaki, J. (2011). Path lengths, correlations, and centrality in temporal networks. Physical Review E, 84(1), 016105. DOI ↗ | Holme, P., & Saramäki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ |
| Aliassen | time-varying closeness centrality, dynamic closeness centrality, TCC, temporal reachability-based centrality | TBC, time-varying betweenness centrality, dynamic betweenness centrality, time-respecting betweenness |
| Verwant | 6 | 6 |
| Samenvatting≠ | Temporal closeness centrality extends the classical closeness measure to time-varying networks by replacing static shortest paths with time-respecting (foremost) paths. It quantifies how quickly a node can reach all other nodes when interactions occur at specific moments in time, giving a more realistic picture of information flow, disease spread, and influence in dynamic systems. | 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. |
| ScholarGateGegevensset ↗ |
|
|