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.
| Độ trung tâm giữa hai điểm theo thời gian (Temporal Betweenness Centrality)× | Độ 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≠ | 2012 | 2011–2012 |
| Người khởi xướng≠ | Kim, H. & Anderson, R.; Holme, P. & Saramäki, J. | 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≠ | Holme, P., & Saramäki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ | Holme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ |
| Tên gọi khác | TBC, time-varying betweenness centrality, dynamic betweenness centrality, time-respecting betweenness | time-varying degree centrality, dynamic degree centrality, temporal node degree, TDC |
| Liên quan | 6 | 6 |
| Tóm tắt≠ | 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 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 ↗ |
|
|