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: https://stanford.io/3CmrFSE

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:
http://web.stanford.edu/class/cs224w/

#Jure Leskovec #Machine Learning #CS224W #Stanford #graphs #directed vs. undirected #weighted vs. unweighted #homogeneous vs bipartite #abstracting graphs