Stanford CS224W: Machine Learning with Graphs - Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 4.3 - Random Walk with Restarts

For more information about Stanford’s Artificial Intelligence professional and graduate programs, visit: https://stanford.io/3pH97t6 Lecture 4.3 - Random Walk with Restarts and Personalized PageRank Jure Leskovec Computer Science, PhD We discuss Personalized PageRank, which ranks the proximity of nodes to a given subset of query nodes S (i.e. the teleportation set), and Random Walk which models random walks from a single starting node to rank node proximity. We demonstrate how these algorithms relate to our original definition of PageRank where we model a random surfer moving across the links of the graph while randomly teleporting to any node, a subset of all nodes, or a single node in the graph. To follow along with the course schedule and syllabus, visit: http://web.stanford.edu/class/cs224w/