Jure Leskovec
Computer Science, PhD
In previous lectures, we focused on graph representation learning in Euclidean embedding spaces. In this lecture, we introduce hyperbolic embedding spaces, which are great for modeling hierarchical, tree-like graphs. Moreover, we introduce basics for hyperbolic geometry models, which leads to the idea of hyperbolic GNNs. More details can be found in the paper: Hyperbolic Graph Convolutional Neural Networks:
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:
1 view
6
5
2 years ago 00:27:07 1
CS224W: Machine Learning with Graphs | 2021 | Lecture Walk Approaches for Node Embeddings
2 years ago 00:20:10 1
CS224W: Machine Learning with Graphs | 2021 | Lecture 2.3 - Traditional Feature-based Methods: Graph
2 years ago 00:27:30 1
CS224W: Machine Learning with Graphs | 2021 | Lecture 2.1 - Traditional Feature-based Methods: Node