Teaching or conference talk · for advanced
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 4.1 - PageRank
This video is about 5 years old. Search advice changes quickly, so check this against current guidance.
About this video
PageRank, random walks and matrix factorisation are worked through in a Stanford lecture from Jure Leskovec, which treats graphs as matrices and builds towards node embeddings. Lecture 4.1 of the CS224W course.
Good to know: University-level maths
Why watch it
A Stanford lecture on PageRank, random walks and matrix factorisation, part of a machine learning with graphs course. Expect university-level maths.
On the same topics
Teaching or conference talk
IR Course Lecture 16: Popularity - Page Rank and HITS
Older: check current guidanceTeaching or conference talk
Google’s PageRank Algorithm Explained with Examples | Georgia Tech CSE6242
Older: check current guidanceTeaching or conference talk
M4ML - Linear Algebra - 5.7 Introduction to PageRank
Older: check current guidanceTeaching or conference talk
Temporal Networks, Where Page Rank meets Lord of the Rings - Computerphile
Teaching or conference talk
Data Mining (Spring 2023) - PageRank Part II
Older: check current guidance
