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.
| PageRank Thời gian× | Tính trung tâm eigenvector 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≠ | 2016 | 2011-2017 |
| Người khởi xướng≠ | Rozenshtein, P. & Gionis, A. | Grindrod, P.; Higham, D. J.; Taylor, D. et al. |
| Loại≠ | Centrality / ranking algorithm for temporal networks | Centrality measure for temporal networks |
| Công trình gốc≠ | Rozenshtein, P. & Gionis, A. (2016). Temporal PageRank. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), Part II, LNCS 9852, pp. 674–689. Springer. DOI ↗ | Grindrod, P., Parsons, M. C., Higham, D. J., & Estrada, E. (2011). Communicability across evolving networks. Physical Review E, 83(4), 046120. DOI ↗ |
| Tên gọi khác | TPR, time-aware PageRank, streaming PageRank, dynamic PageRank | dynamic eigenvector centrality, time-varying eigenvector centrality, TEC, temporal communicability centrality |
| Liên quan≠ | 6 | 5 |
| Tóm tắt≠ | Temporal PageRank extends the classic PageRank algorithm to time-evolving networks by incorporating the recency and ordering of interactions. Edges are weighted by a decay function so that recent contacts contribute more to a node's score than old ones. The result is a dynamic importance ranking that captures who is influential right now, rather than over the entire history of the network. | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|