liveBook · Manning

Heterogeneous graph convolutional network

As explained in Graph Neural Networks in Action

A graph convolutional network that applies relation-specific transformations or parameters to graphs containing multiple edge types.

Use a heterogeneous graph convolutional network when nodes connect through multiple edge types, such as single, double, triple, or aromatic molecular bonds. It adapts message passing by learning relation-specific parameters instead of treating every edge identically. section 5.4.3

A practical implementation follows this pipeline:

  • Store one parameter matrix per relation, indexed by each edge's type. section 5.4.3
  • Run PyG message passing with summation aggregation, passing node features, edge indices, and edge types. section 5.4.3

Molecular graph generation

A variational graph autoencoder can encode molecular graphs with heterogeneous bond types, decode adjacency and node features, and predict a molecular property such as QED.

How Graph Neural Networks in Action covers it

How deep it goes
Builds a custom MessagePassing layer, relation-specific weights, additive aggregation, and stacked encoder layers; defers mathematical derivation.
Examples
Uses molecular graphs whose bonds include single, double, triple, and aromatic edge types.
What it assumes
Assumes graph convolution and message-passing familiarity while distinguishing heterogeneous graphs from single-edge-type homogeneous graphs.
What you can do after
Build it from scratch with PyTorch Geometric's MessagePassing API or apply the HeteroConv model family.
How it connects
Connects graph convolutional networks with message passing, variational graph autoencoders, graph decoders, and property prediction.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Graph Neural Networks in Action. The section links point to the parts of the book it draws on.