– tags: Graph Convolutions

Basics

Spectral Graph Convolutional Network:

  • GSP is the key to generalizing convolutions, allowing us to build functions that can take into account both the overall structure of the graph and the individual properties of the graph’s components.
  • It is the graph fourier transform that allows one to introduce the notion of a “bandwidth” or “smoothness” to a graph
  • In GCNs, node features and attributes are represented by “signals”.
  • Calculating the eigenvectors of the Laplacian, returns the Fourier basis for the graph.

Steps

  • Transform the graph into the spectral domain using eigendecomposition
  • Apply eigendecomposition to the specified kernel
  • Multiply the spectral graph and spectral kernel (like vanilla convolutions)
  • Return results in the original spatial domain (analogous to inverse GFT)