Machine learningNetwork science

Vremenski PageRank

Vremenski PageRank proširuje klasični PageRank algoritam na mreže koje se razvijaju u vremenu ugrađivanjem novijih i redosleda interakcija. Ivice se ponderišu funkcijom opadanja tako da nedavni kontakti više doprinose rezultatu čvora nego stari. Rezultat je dinamičko rangiranje važnosti koje obuhvata ko je trenutno uticajan, umesto tokom celokupne istorije mreže.

Otvorite u MethodMindUskoroVideoUskoroDownload slides

Pročitajte celu metodu

Samo za članove

Prijavite se besplatnim nalogom da biste pročitali ovaj odeljak.

Prijavite se

Method map

The neighbourhood of related methods — select a node to explore.

Izvori

  1. 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: 10.1007/978-3-319-46227-1_42
  2. Lerman, K. & Ghosh, R. (2010). Information Contagion: An Empirical Study of the Spread of News on Digg and Twitter Social Networks. In Proceedings of the Fourth International AAAI Conference on Weblogs and Social Media (ICWSM), pp. 90–97. AAAI Press. link

Kako citirati ovu stranicu

ScholarGate. (2026, June 3). Temporal PageRank (Time-Aware Node Importance Ranking in Temporal Networks). ScholarGate. https://scholargate.app/sr/network-analysis/temporal-pagerank

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

Citirana u

ScholarGateTemporal PageRank (Temporal PageRank (Time-Aware Node Importance Ranking in Temporal Networks)). Preuzeto 2026-06-15 sa https://scholargate.app/sr/network-analysis/temporal-pagerank · Skup podataka: https://doi.org/10.5281/zenodo.20539026