Abstract

Node distance/proximity measures are used for quantifying how nearby or otherwise related two or more nodes on a graph are. In particular, personalized PageRank (PPR) based measures of node proximity have been shown to be highly effective in many prediction and recommendation applications. Despite its effectiveness, however, the use of personalized PageRank for large graphs 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)
JournalKnowledge and Information Systems
DOIs
StateAccepted/In press - Jun 18 2015

Fingerprint

Seed
Costs
Experiments

Keywords

  • Locality-sensitivity
  • Personalized PageRank
  • Reuse-promotion
  • Scalability

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Information Systems
  • Hardware and Architecture
  • Human-Computer Interaction

Cite this

Locality-sensitive and Re-use Promoting Personalized PageRank computations. / Kim, Jung Hyun; Candan, Kasim; Sapino, Maria Luisa.

In: Knowledge and Information Systems, 18.06.2015.

Research output: Contribution to journalArticle

@article{f52d2f80495e40438dbe19cdd944adb0,
title = "Locality-sensitive and Re-use Promoting Personalized PageRank computations",
abstract = "Node distance/proximity measures are used for quantifying how nearby or otherwise related two or more nodes on a graph are. In particular, personalized PageRank (PPR) based measures of node proximity have been shown to be highly effective in many prediction and recommendation applications. Despite its effectiveness, however, the use of personalized PageRank for large graphs 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, Scalability",
author = "Kim, {Jung Hyun} and Kasim Candan and Sapino, {Maria Luisa}",
year = "2015",
month = "6",
day = "18",
doi = "10.1007/s10115-015-0843-6",
language = "English (US)",
journal = "Knowledge and Information Systems",
issn = "0219-1377",
publisher = "Springer London",

}

TY - JOUR

T1 - Locality-sensitive and Re-use Promoting Personalized PageRank computations

AU - Kim, Jung Hyun

AU - Candan, Kasim

AU - Sapino, Maria Luisa

PY - 2015/6/18

Y1 - 2015/6/18

N2 - Node distance/proximity measures are used for quantifying how nearby or otherwise related two or more nodes on a graph are. In particular, personalized PageRank (PPR) based measures of node proximity have been shown to be highly effective in many prediction and recommendation applications. Despite its effectiveness, however, the use of personalized PageRank for large graphs 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 - Node distance/proximity measures are used for quantifying how nearby or otherwise related two or more nodes on a graph are. In particular, personalized PageRank (PPR) based measures of node proximity have been shown to be highly effective in many prediction and recommendation applications. Despite its effectiveness, however, the use of personalized PageRank for large graphs 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

KW - Scalability

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

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

U2 - 10.1007/s10115-015-0843-6

DO - 10.1007/s10115-015-0843-6

M3 - Article

JO - Knowledge and Information Systems

JF - Knowledge and Information Systems

SN - 0219-1377

ER -