So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Tính trung tâm eigenvector thời gian× | Độ tập trung bậc theo thời gian× | |
|---|---|---|
| Lĩnh vực | Phân tích mạng lưới | Phân tích mạng lưới |
| Họ | Machine learning | Machine learning |
| Năm ra đời≠ | 2011-2017 | 2011–2012 |
| Người khởi xướng≠ | Grindrod, P.; Higham, D. J.; Taylor, D. et al. | Holme, P.; Saramaki, J.; Kim, H.; Anderson, R. |
| Loại≠ | Centrality measure for temporal networks | Centrality measure (temporal extension) |
| Công trình gốc≠ | Grindrod, P., Parsons, M. C., Higham, D. J., & Estrada, E. (2011). Communicability across evolving networks. Physical Review E, 83(4), 046120. DOI ↗ | Holme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ |
| Tên gọi khác | dynamic eigenvector centrality, time-varying eigenvector centrality, TEC, temporal communicability centrality | time-varying degree centrality, dynamic degree centrality, temporal node degree, TDC |
| Liên quan≠ | 5 | 6 |
| Tóm tắt≠ | 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 degree centrality extends the classic degree centrality to time-varying networks by counting how many distinct contacts a node accumulates over time. Rather than collapsing a dynamic network into a single static graph, it preserves the temporal order of edges, yielding a more faithful measure of a node's activity and reachability across the observation window. |
| ScholarGateBộ dữ liệu ↗ |
|
|