CS224W: Machine Learning with Graphs | 2021 | Lecture 3.3 - Embedding Entire Graphs

Jure Leskovec Computer Science, PhD In some scenarios it is important to not only learn embeddings for nodes, but also the entire graph. In this video, we introduce several approaches that could effectively learn embeddings for entire graphs, including aggregation of node embeddings, as well as the anonymous walk embedding approach. To follow along with the course schedule and syllabus, visit: To get the latest news on Stanford’s upcoming professional programs in Artificial Intelligence, visit: To view all online courses and programs offered by Stanford, visit: ​