Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Stanford University

Machine Learning with Graphs

Stanford University via YouTube

Overview

Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the comprehensive Stanford course that covers the structure and analysis of large social and information networks through machine learning approaches. Master traditional feature-based methods for nodes, links, and graphs before diving into modern node embeddings and random walk approaches. Learn fundamental algorithms like PageRank, matrix factorization, and collective classification techniques for network analysis. Develop expertise in Graph Neural Networks (GNNs), starting with basic deep learning concepts and progressing to advanced GNN architectures, training methods, and expressiveness analysis. Investigate heterogeneous networks and knowledge graph embeddings, including completion algorithms and reasoning techniques like Query2box. Study neural subgraph matching, community detection algorithms including Louvain, and both classical and deep generative models for graphs. Address practical challenges such as GNN limitations, scaling techniques like GraphSAGE and Cluster GCN, and specialized applications in computational biology. Conclude with advanced topics including pre-training strategies, hyperbolic embeddings, and comprehensive design principles for Graph Neural Networks, providing both theoretical foundations and practical skills for analyzing large-scale network data.

Syllabus

Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 1.1 - Why Graphs
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 1.2 - Applications of Graph ML
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 1.3 - Choice of Graph Representation​
Stanford CS224W: ML with Graphs | 2021 | Lecture 2.1 - Traditional Feature-based Methods: Node
Stanford CS224W: ML with Graphs | 2021 | Lecture 2.2 - Traditional Feature-based Methods: Link
Stanford CS224W: ML with Graphs | 2021 | Lecture 2.3 - Traditional Feature-based Methods: Graph
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 3.1 - Node Embeddings
Stanford CS224W: ML with Graphs | 2021 | Lecture 3.2-Random Walk Approaches for Node Embeddings
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 3.3 - Embedding Entire Graphs
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 4.1 - PageRank
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 4.2 - PageRank: How to Solve?
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 4.3 - Random Walk with Restarts
Stanford CS224W: ML with Graphs | 2021 | Lecture 4.4 - Matrix Factorization and Node Embeddings
Stanford CS224W: ML with Graphs | 2021 | Lecture 5.1 - Message passing and Node Classification
Stanford CS224W: ML with Graphs | 2021 | Lecture 5.2 - Relational and Iterative Classification
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 5.3 - Collective Classification
Stanford CS224W: ML with Graphs | 2021 | Lecture 6.1 - Introduction to Graph Neural Networks
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 6.2 - Basics of Deep Learning
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 6.3 - Deep Learning for Graphs
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 7.1 - A general Perspective on GNNs
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 7.2 - A Single Layer of a GNN
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 7.3 - Stacking layers of a GNN
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 8.1 - Graph Augmentation for GNNs
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 8.2 - Training Graph Neural Networks
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 8.3 - Setting up GNN Prediction Tasks
Stanford CS224W: ML with Graphs | 2021 | Lecture 9.1 - How Expressive are Graph Neural Networks
Stanford CS224W: ML with Graphs | 2021 | Lecture 9.2 - Designing the Most Powerful GNNs
Stanford CS224W: ML with Graphs | 2021 | Lecture 10.1-Heterogeneous & Knowledge Graph Embedding
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 10.2 - Knowledge Graph Completion
Stanford CS224W: ML with Graphs | 2021 | Lecture 10.3 - Knowledge Graph Completion Algorithms
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 11.1 - Reasoning in Knowledge Graphs
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 11.2 - Answering Predictive Queries
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 11.3 - Query2box: Reasoning over KGs
Stanford CS224W: ML with Graphs | 2021 | Lecture 12.1-Fast Neural Subgraph Matching & Counting
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 12.2 - Neural Subgraph Matching
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 12.3 - Finding Frequent Subgraphs
Stanford CS224W: ML with Graphs | 2021 | Lecture 13.1 - Community Detection in Networks
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 13.2 - Network Communities
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 13.3 - Louvain Algorithm
Stanford CS224W: ML with Graphs | 2021 | Lecture 13.4 - Detecting Overlapping Communities
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 14.1 - Generative Models for Graphs
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 14.2 - Erdos Renyi Random Graphs
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 14.3 - The Small World Model
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 14.4 - Kronecker Graph Model
Stanford CS224W: ML with Graphs | 2021 | Lecture 15.1 - Deep Generative Models for Graphs
Stanford CS224W: ML with Graphs | 2021 | Lecture 15.2 - Graph RNN: Generating Realistic Graphs
Stanford CS224W: ML with Graphs | 2021 | Lecture 15.3 - Scaling Up & Evaluating Graph Gen
Stanford CS224W: ML with Graphs | 2021 | Lecture 15.4 - Applications of Deep Graph Generation
Stanford CS224W: ML with Graphs | 2021 | Lecture 16.1 - Limitations of Graph Neural Networks
Stanford CS224W: ML with Graphs | 2021 | Lecture 16.2 - Position-Aware Graph Neural Networks
Stanford CS224W: ML with Graphs | 2021 | Lecture 16.3 - Identity-Aware Graph Neural Networks
Stanford CS224W: ML with Graphs | 2021 | Lecture 16.4 - Robustness of Graph Neural Networks
Stanford CS224W: ML with Graphs | 2021 | Lecture 17.1 - Scaling up Graph Neural Networks
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 17.2 - GraphSAGE Neighbor Sampling
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 17.3 - Cluster GCN: Scaling up GNNs
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 17.4 - Scaling up by Simplifying GNNs
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 18 - GNNs in Computational Biology
Stanford CS224W: ML with Graphs | 2021 | Lecture 19.1 - Pre-Training Graph Neural Networks
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 19.2 - Hyperbolic Graph Embeddings
Stanford CS224W: ML with Graphs | 2021 | Lecture 19.3 - Design Space of Graph Neural Networks

Taught by

Stanford Online

Reviews

Start your review of Machine Learning with Graphs

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.