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ập trung cận kề thời gian× | Độ trung tâm giữa× | |
|---|---|---|
| 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 | 1977 |
| Người khởi xướng≠ | Pan, R. K. & Saramaki, J. | Freeman, L. C. |
| Loại≠ | Centrality measure (temporal) | Centrality measure |
| Công trình gốc≠ | Pan, R. K., & Saramaki, J. (2011). Path lengths, correlations, and centrality in temporal networks. Physical Review E, 84(1), 016105. DOI ↗ | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ |
| Tên gọi khác | time-varying closeness centrality, dynamic closeness centrality, TCC, temporal reachability-based centrality | Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness |
| Liên quan | 6 | 6 |
| Tóm tắt≠ | 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. | Betweenness centrality, formalized by Linton C. Freeman in 1977, measures how often a node lies on the shortest path connecting every other pair of nodes in a network. High-betweenness nodes act as bridges or brokers: removing them fragments the network into disconnected components more severely than removing any other nodes. |
| ScholarGateBộ dữ liệu ↗ |
|
|