Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Bayesovský PageRank× | Temporální PageRank× | |
|---|---|---|
| Obor | Analýza sítí | Analýza sítí |
| Rodina | Machine learning | Machine learning |
| Rok vzniku≠ | 1999 (PageRank); 2000s (Bayesian extension) | 2016 |
| Tvůrce≠ | Page, L. & Brin, S. (PageRank); Bayesian extension by multiple authors | Rozenshtein, P. & Gionis, A. |
| Typ≠ | Probabilistic centrality measure | Centrality / ranking algorithm for temporal networks |
| Původní zdroj≠ | Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The PageRank citation ranking: Bringing order to the web. Stanford InfoLab Technical Report. link ↗ | 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 ↗ |
| Další názvy | Bayesian PR, probabilistic PageRank, uncertainty-aware PageRank, stochastic PageRank | TPR, time-aware PageRank, streaming PageRank, dynamic PageRank |
| Příbuzné | 6 | 6 |
| Shrnutí≠ | Bayesian PageRank extends the classic PageRank algorithm by embedding it within a Bayesian probabilistic framework. Instead of returning a single deterministic rank score for each node, it quantifies uncertainty over rank estimates — particularly valuable when the network is incomplete, noisy, or observed with error. It is used in web analysis, citation networks, and social network research where rank uncertainty matters. | 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. |
| ScholarGateDatová sada ↗ |
|
|