Gain insights into graph machine learning fundamentals, explore graph analytics, and delve into advanced topics like graph embedding and neural networks, enhancing your skills for research and 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)** Knowledge graph triples are undirected.

(True or False) Knowledge graph triples are undirected.

**(Select all that apply.)** Which provides a foundation for building knowledge graphs? 

(Select all that apply.) Which provides a foundation for building knowledge graphs?

Which use case accurately describes Google's search engine?

Which use case accurately describes Google’s search engine?

A function that takes triples as input and outputs a numerical value.

A function that stores the number of entities present in the graph.

A function that measures the learning rate of the algorithm.

A function that computes the distance between two entities.

What is a scoring function in an embedding algorithm?

What is a scoring function in an embedding algorithm?

**(True or False)** Negative sampling is a part of the embedding generation algorithm.

(True or False) Negative sampling is a part of the embedding generation algorithm.

Test your understanding of knowledge graphs and knowledge graph embeddings.

About the Course

Introduction to Graph Theory

Graph Embeddings

Supervised and Unsupervised Graph ML

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: Knowledge Graphs