Name
Abstract | ||
|---|---|---|
Personalized PageRank is a standard tool for finding vertices in a graph that are most relevant to a query or user. To personalize PageRank, one adjusts node weights or edge weights that determine teleport probabilities and transition probabilities in a random surfer model. There are many fast methods to approximate PageRank when the node weights are personalized; however, personalization based on edge weights has been an open problem since the dawn of personalized PageRank over a decade ago. In this paper, we describe the first fast algorithm for computing PageRank on general graphs when the edge weights are personalized. Our method, which is based on model reduction, outperforms existing methods by nearly five orders of magnitude. This huge performance gain over previous work allows us --- for the very first time --- to solve learning-to-rank problems for edge weight personalization at interactive speeds, a goal that had not previously been achievable for this class of problems. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2783258.2783278 | ACM Knowledge Discovery and Data Mining |
Keywords | Field | DocType |
Personalized PageRank,Model Reduction | PageRank,Orders of magnitude (numbers),Graph,Data mining,Open problem,Vertex (geometry),Computer science,Theoretical computer science,Personalization | Conference |
Citations | PageRank | References |
13 | 0.65 | 28 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenlei Xie | 1 | 486 | 22.55 |
| David Bindel | 2 | 427 | 29.24 |
| A J Demers | 3 | 8151 | 2084.66 |
| Johannes Gehrke | 4 | 13362 | 1055.06 |