Personalized PageRank with node-dependent restart

10Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Personalized PageRank is an algorithm to classify the importance of web pages on a user-dependent basis. We introduce two generalizations of Personalized PageRank with node-dependent restart. The first generalization is based on the proportion of visits to nodes before the restart, whereas the second generalization is based on the proportion of time a node is visited just before the restart. In the original case of constant restart probability, the two measures coincide. We discuss interesting particular cases of restart probabilities and restart distributions. We show that both generalizations of Personalized PageRank have an elegant expression connecting the so-called direct and reverse Personalized PageRanks that yield a symmetry property of these Personalized PageRanks.

Cite

CITATION STYLE

APA

Avrachenkov, K., van der Hofstad, R., & Sokol, M. (2014). Personalized PageRank with node-dependent restart. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8882, 23–33. https://doi.org/10.1007/978-3-319-13123-8_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free