Gain insights into graph machine learning fundamentals. Explore graph analytics, and advanced topics like graph embedding and neural networks, enhancing your skills for practical applications.

networkx.tar.gz

Networkx

Are you ready to attain mastery in graph machine learning? Graphs are ubiquitous and have diverse applications in various fields. In this introductory course, you will learn the fundamentals of graph machine learning so that you’re able to work with different types of graphs, state-of-the-art graph machine learning techniques, and various graph analytics tasks.

The course begins with the basics of graphs and gradually progresses to more advanced topics, including graph embedding and its different techniques and different use cases built on knowledge graphs. 

By the end of the course, you will have gained hands-on experience in creating and manipulating graphs, as well as a comprehensive understanding of knowledge graphs and graph neural networks. This course will equip you with the skills and knowledge to step into advanced graph machine learning topics for research or practical applications and take your career to the next level.

Introduction to Graph Machine Learning

**(True or False)** Indegree is a property of an undirected graph.

(True or False) Indegree is a property of an undirected graph.

`nx.DiGraph([('Paris','London'),('Berlin','Paris')])`

`nx.DiGraph([('London','Paris'),('Berlin','Paris')])`

`nx.DiGraph([('London','Paris'),('Paris','Berlin')])`

`nx.DiGraph([('Paris','London'),('Paris','Berlin')])`

Which code visualizes a directed graph with three nodes (`London`, `Paris`, and `Berlin`) with their indegrees as `0`, `2`, and `0`, respectively?

Which code visualizes a directed graph with three nodes (<code>London</code>, <code>Paris</code>, and <code>Berlin</code>) with their indegrees as <code>0</code>, <code>2</code>, and <code>0</code>, respectively?

**(True or False)** An adjacency matrix can be used to store edge weights.

(True or False) An adjacency matrix can be used to store edge weights.

**(True or False)** A knowledge graph is an example of a multi-relational graph.

(True or False) A knowledge graph is an example of a multi-relational graph.

**(True or False)** Indegree and outdegree are the same in an undirected graph.

(True or False) Indegree and outdegree are the same in an undirected graph.

Consider a five-node undirected graph with an edge list of ${(1$, $2)$, $(2$, $3)$, $(3$, $4)$, $(4$, $5)$, $(5$, $1)}$. What is the determinant of the adjacency matrix of the graph?

Consider a five-node undirected graph with an edge list of {(1, <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">2)</annotation></semantics></math>2), <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">(</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">(2</annotation></semantics></math>(2, <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">3)</annotation></semantics></math>3), <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">(</mo><mn>3</mn></mrow><annotation encoding="application/x-tex">(3</annotation></semantics></math>(3, <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>4</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">4)</annotation></semantics></math>4), <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">(</mo><mn>4</mn></mrow><annotation encoding="application/x-tex">(4</annotation></semantics></math>(4, <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>5</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">5)</annotation></semantics></math>5), <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">(</mo><mn>5</mn></mrow><annotation encoding="application/x-tex">(5</annotation></semantics></math>(5, 1)}. What is the determinant of the adjacency matrix of the graph?

About the Course

Introduction to Graph Theory

Graph Embeddings

Supervised and Unsupervised Graph ML

Graph Neural Networks

Link-Based Classification Using Graph Neural Networks

Knowledge Graph

Knowledge Graph Embeddings

Case Study: Link Prediction on a Social Network Graph

Case Study: Node Classification on a Biological Graph

Appendix

Quiz: Graph Theory