Fig. 6: Exemplary graph G with six vertices and nine edges.

For example, the vertices v₁ and v₂ are connected via the edge e_1,2, thereby A_1,2 = 1 in the adjacency matrix A. In this toy example, every feature vector x consists of a time series of d = 10 values and is stored in the node attribute matrix X^N×d.