liveBook · Manning

Feature matrix

As explained in Graph Neural Networks in Action

A matrix whose entries encode feature values for a collection of entities or graph elements.

A feature matrix stores values describing entities or graph elements. In molecular graph generation, it is reconstructed alongside the adjacency matrix so the generated graph preserves both connectivity and node information. section 5.4.3 section 5.4.4

A feature matrix participates in the generation pipeline as follows:

  • Represent each molecular graph with graph data containing node features in `data.x`. section 5.4.4
  • Encode graph features into a latent representation using heterogeneous graph-convolution layers and relation-specific edge types. section 5.4.3
  • Decode the latent representation into both an adjacency matrix and a feature matrix for each small graph. section 5.4.3

Molecular graph generation

A variational graph autoencoder receives molecular graph data, predicts a feature matrix and adjacency matrix, and trains against the original graph while also predicting QED. The resulting latent space clusters molecules with higher QED, supporting exploration of regions likely to produce candidate molecules. section 5.4.4

How Graph Neural Networks in Action covers it

How deep it goes
Defines the matrix’s reconstruction role and implementation outputs, but does not detail feature encoding semantics.
Examples
Uses molecular node features in `data.x`, decoded feature matrices, and generated small-molecule graphs.
What it assumes
Assumes graph data with node features and edges, while demonstrating how those features enter a variational graph autoencoder.
What you can do after
Build it from scratch using PyTorch decoder layers that emit feature and adjacency matrices for graph reconstruction.
How it connects
Connects feature matrices to adjacency matrices, graph autoencoders, graph neural networks, latent spaces, and molecular graphs.

Also explained in

Compare how 2 books explain feature matrix →

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.