Sign inSign up
FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs

Published on Oct 07, 20141963 Views

Peter Lofgren

We propose a new algorithm, FAST-PPR, for estimating personalized PageRank: given start node s and target node t in a directed graph, and given a threshold δ, FAST-PPR estimates the Personalized PageR

Research Sessions

Related categories

Data MiningKnowledge Extraction

Chapter list

FAST-PPR: Personalized PageRank Estimation for Large Graphs00:00
Motivation: Personalized Search - 100:12
Motivation: Personalized Search - 200:50
Result Preview01:28
Personalized PageRank02:00
Goal03:06
Previous Algorithm: Monte-Carlo04:36
Previous Algorithm: Local Update05:00
Main Result05:45
Analogy: Bidirectional Search06:58
Bidirectional PageRank Algorithm08:01
Main Idea08:50
Experimental Setup09:26
Empirical Running Time10:17
Summary11:00
Thank You11:50