A free, project-based course
This summer Octavian is hosting an online course, covering the main approaches to machine learning on graphs. This summer we're publishing a set of exercises and hosting weekly Q&A sessions to help you learn about this exciting new area.
We'll email you when new exercises come out and also occasionally mail you news about the course.
The course has a couple of components:
To receive the latest projects and updates, join the mailing list above.
You can find all the materials published so far here. As we publish new materials we'll announce them on the mailing list, chatroom and add them here.
1.
An article explaining the required background to get the most out of this course. There are lots of links to helpful learning resources.
2.
Introduction to graphs and TensorFlow
Introduces you to TensorFlow and working with graph data. In this exercise you will perform some very simple node classification.
Answers
3.
Node classification using graph convolutions
Create a graph convolutional network in Keras to classify nodes in a paper citation graph.
Answers
4.
Build a network that can predict whether two nodes in a graph are connected.
Solution
Answers
5.
Graph generation
Not yet published
I'm aiming to keep a regular cadence of project publications, although with my work commitments they may be a bit sporadic. This is an open-source effort, if you want to help write exercises you're really welcome to collaborate (chat with David and Andy in Discord).
To get an overview of machine learning on graphs, check out our talk and article.
A list of resources to learn the pre-requisites is now online.
To get the most out of this course, it's important everyone has the same foundation. This is not an introduction to machine learning, we will the assume each student is familiar with the following:
Students are expected to be self-motivated, curious and enthusiastic about machine learning on graphs. You'll get the most out of this course by completing the (moderate time commitment) coursework, so make sure you have the free time and energy needed for that.