השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| מרכזיות קרבה זמנית× | PageRank זמני× | |
|---|---|---|
| תחום | ניתוח רשתות | ניתוח רשתות |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 2011 | 2016 |
| הוגה השיטה≠ | Pan, R. K. & Saramaki, J. | Rozenshtein, P. & Gionis, A. |
| סוג≠ | Centrality measure (temporal) | Centrality / ranking algorithm for temporal networks |
| מקור מכונן≠ | Pan, R. K., & Saramaki, J. (2011). Path lengths, correlations, and centrality in temporal networks. Physical Review E, 84(1), 016105. DOI ↗ | 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 ↗ |
| כינויים | time-varying closeness centrality, dynamic closeness centrality, TCC, temporal reachability-based centrality | TPR, time-aware PageRank, streaming PageRank, dynamic PageRank |
| קשורות | 6 | 6 |
| תקציר≠ | 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 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. |
| ScholarGateמערך נתונים ↗ |
|
|