@inproceedings{c95e510c78bc41df90a7c9a256eca3ba,
title = "LR-PPR: Locality-sensitive, re-use promoting, approximate personalized PageRank computation",
abstract = "Personalized PageRank (PPR) based measures of node proximity have been shown to be highly effective in many prediction and recommendation applications. The use of personalized PageRank for large graphs, however, is difficult due to its high computation cost. In this paper, we propose a Locality-sensitive, Re-use promoting, approximate personalized PageRank (LR-PPR) algorithm for efficiently computing the PPR values relying on the localities of the given seed nodes on the graph: (a) The LR-PPR algorithm is locality sensitive in the sense that it reduces the computational cost of the PPR computation process by focusing on the local neighborhoods of the seed nodes. (b) LR-PPR is re-use promoting in that instead of performing a monolithic computation for the given seed node set using the entire graph, LR-PPR divides the work into localities of the seeds and caches the intermediary results obtained during the computation. These cached results are then reused for future queries sharing seed nodes. Experiment results for different data sets and under different scenarios show that LR-PPR algorithm is highly-efficient and accurate.",
keywords = "Locality-sensitivity, Personalized PageRank, Reuse-promotion",
author = "Kim, {Jung Hyun} and Kasim Candan and Sapino, {Maria Luisa}",
year = "2013",
doi = "10.1145/2505515.2505651",
language = "English (US)",
isbn = "9781450322638",
series = "International Conference on Information and Knowledge Management, Proceedings",
pages = "1801--1806",
booktitle = "CIKM 2013 - Proceedings of the 22nd ACM International Conference on Information and Knowledge Management",
note = "22nd ACM International Conference on Information and Knowledge Management, CIKM 2013 ; Conference date: 27-10-2013 Through 01-11-2013",
}