4 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationInternational Conference on Information and Knowledge Management, Proceedings
Pages1801-1806
Number of pages6
DOIs
StatePublished - 2013
Event22nd ACM International Conference on Information and Knowledge Management, CIKM 2013 - San Francisco, CA, United States
Duration: Oct 27 2013Nov 1 2013

Other

Other22nd ACM International Conference on Information and Knowledge Management, CIKM 2013
CountryUnited States
CitySan Francisco, CA
Period10/27/1311/1/13

Fingerprint

Reuse
Locality
PageRank
Node
Graph
Costs
Query
Prediction
Scenarios
Proximity
Experiment
Intermediaries

Keywords

  • Locality-sensitivity
  • Personalized PageRank
  • Reuse-promotion

ASJC Scopus subject areas

  • Business, Management and Accounting(all)
  • Decision Sciences(all)

Cite this

Kim, J. H., Candan, K., & Sapino, M. L. (2013). LR-PPR: Locality-sensitive, re-use promoting, approximate personalized PageRank computation. In International Conference on Information and Knowledge Management, Proceedings (pp. 1801-1806) https://doi.org/10.1145/2505515.2505651

LR-PPR : Locality-sensitive, re-use promoting, approximate personalized PageRank computation. / Kim, Jung Hyun; Candan, Kasim; Sapino, Maria Luisa.

International Conference on Information and Knowledge Management, Proceedings. 2013. p. 1801-1806.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, JH, Candan, K & Sapino, ML 2013, LR-PPR: Locality-sensitive, re-use promoting, approximate personalized PageRank computation. in International Conference on Information and Knowledge Management, Proceedings. pp. 1801-1806, 22nd ACM International Conference on Information and Knowledge Management, CIKM 2013, San Francisco, CA, United States, 10/27/13. https://doi.org/10.1145/2505515.2505651
Kim JH, Candan K, Sapino ML. LR-PPR: Locality-sensitive, re-use promoting, approximate personalized PageRank computation. In International Conference on Information and Knowledge Management, Proceedings. 2013. p. 1801-1806 https://doi.org/10.1145/2505515.2505651
Kim, Jung Hyun ; Candan, Kasim ; Sapino, Maria Luisa. / LR-PPR : Locality-sensitive, re-use promoting, approximate personalized PageRank computation. International Conference on Information and Knowledge Management, Proceedings. 2013. pp. 1801-1806
@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",
pages = "1801--1806",
booktitle = "International Conference on Information and Knowledge Management, Proceedings",

}

TY - GEN

T1 - LR-PPR

T2 - Locality-sensitive, re-use promoting, approximate personalized PageRank computation

AU - Kim, Jung Hyun

AU - Candan, Kasim

AU - Sapino, Maria Luisa

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Locality-sensitivity

KW - Personalized PageRank

KW - Reuse-promotion

UR - http://www.scopus.com/inward/record.url?scp=84889595974&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84889595974&partnerID=8YFLogxK

U2 - 10.1145/2505515.2505651

DO - 10.1145/2505515.2505651

M3 - Conference contribution

AN - SCOPUS:84889595974

SN - 9781450322638

SP - 1801

EP - 1806

BT - International Conference on Information and Knowledge Management, Proceedings

ER -