GNN学习记录_3
PageRank
We will cover the following Link Analysis approaches to compute the importance of nodes in a graph:
1.PageRank
2.Personalized PageRank (PPR)
3.Random Walk with Restarts
PageRank:
PageRank Problems:
Dead Ends:
Such pages cause importance to “leak out”.
Solution:
Spider Traps:
Solution:
Summary:
Spider-traps are not a problem, but with traps PageRank scores are not what we want Solution: Never get stuck in a spider trap by teleporting out of it in a finite number of step.
Dead-ends are a problem.The matrix is not column stochastic so our initial assumptions are not met Solution: Make matrix column stochastic by always teleporting when there is nowhere else to go.
Random Walk with Restarts
