Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 1.3 - Choice of Graph Representation
For more information about Stanford’s Artificial Intelligence professional and graduate programs, visit:
Jure Leskovec
Computer Science, PhD
One essential task to consider before we conduct machine learning on graphs is to find an appropriate way to represent the graphs. What are the factors that will affect our choices as to the representations? In this video, we’ll be looking at the different approaches to abstracting graphs: directed vs. undirected, weighted vs. unweighted, homogeneous vs bipartite, and so on.
To follow along with the course schedule and syllabus, visit:
1 view
28
10
5 months ago 00:09:23 1
The Science of Six Degrees of Separation
7 months ago 00:15:04 1
Pourquoi on ne trouve plus rien sur Google
2 years ago 00:16:47 1
CS224W: Machine Learning with Graphs | 2021 | Lecture 2.2 - Traditional Feature-based Methods: Link
2 years ago 00:20:27 2
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 1.2 - Applications of Graph ML
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:20:27 1
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 1.3 - Choice of Graph Representation