ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

PageRank Temporal×Analiza Temporală a Rețelelor Sociale×
DomeniuAnaliza rețelelorAnaliza rețelelor
FamilieMachine learningMachine learning
Anul apariției20162000s–2010s
Autorul originalRozenshtein, P. & Gionis, A.Moody, J.; Holme, P.; Saramäki, J.
TipCentrality / ranking algorithm for temporal networksLongitudinal network analysis
Sursa seminală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 ↗Holme, P., & Saramäki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗
Denumiri alternativeTPR, time-aware PageRank, streaming PageRank, dynamic PageRankTSNA, longitudinal social network analysis, time-varying network analysis, dynamic SNA
Înrudite64
RezumatTemporal 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 Social Network Analysis (TSNA) extends classic social network analysis by treating networks as time-varying structures. Rather than aggregating all ties into a single static snapshot, TSNA tracks when ties form, persist, and dissolve, enabling researchers to study how social structures evolve and how dynamic connectivity shapes diffusion, influence, and inequality over time.
ScholarGateSet de date
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 2 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Temporal PageRank · Temporal Social Network Analysis. Preluat la 2026-06-18 de pe https://scholargate.app/ro/compare