You're reading from Hands-On Graph Neural Networks Using Python

Product type Book

Published in Apr 2023

Publisher Packt

ISBN-13 9781804617526

Pages 354 pages

Edition 1st Edition

Languages

Concepts

Neural Networks

Author (1):

Maxime Labonne

Table of Contents (25) Chapters

Preface

Part 1: Introduction to Graph Learning

Chapter 1: Getting Started with Graph Learning

Chapter 2: Graph Theory for Graph Neural Networks

Chapter 3: Creating Node Representations with DeepWalk

Part 2: Fundamentals

Chapter 4: Improving Embeddings with Biased Random Walks in Node2Vec

Chapter 5: Including Node Features with Vanilla Neural Networks

Chapter 6: Introducing Graph Convolutional Networks

Chapter 7: Graph Attention Networks

Part 3: Advanced Techniques

Chapter 8: Scaling Up Graph Neural Networks with GraphSAGE

Chapter 9: Defining Expressiveness for Graph Classification

Chapter 10: Predicting Links with Graph Neural Networks

Chapter 11: Generating Graphs Using Graph Neural Networks

Chapter 12: Learning from Heterogeneous Graphs

Chapter 13: Temporal Graph Neural Networks

Chapter 14: Explaining Graph Neural Networks

Part 4: Applications

Chapter 15: Forecasting Traffic Using A3T-GCN

Chapter 16: Detecting Anomalies Using Heterogeneous GNNs

Chapter 17: Building a Recommender System Using LightGCN

Chapter 18: Unlocking the Potential of Graph Neural Networks for Real-World Applications

Index

Why subscribe?

Other Books You May Enjoy

Discovering graph concepts

In this section, we will explore some of the essential concepts in graph theory, including graph objects (such as degree and neighbors), graph measures (such as centrality and density), and the adjacency matrix representation.

Fundamental objects

One of the key concepts in graph theory is the degree of a node, which is the number of edges incident to this node. An edge is said to be incident on a node if that node is one of the edge’s endpoints. The degree of a node is often denoted by . It can be defined for both directed and undirected graphs:

In an undirected graph, the degree of a vertex is the number of edges that are connected to it. Note that if the node is connected to itself (called a loop, or self-loop), it adds two to the degree.
In a directed graph, the degree is divided into two types: indegree and outdegree. The indegree (denoted by ) of a node represents the number of edges that point towards that node, while the outdegree...