Skip to main content
. 2020 Jul 1;4(3):507–527. doi: 10.1162/netn_a_00133

Figure 6. .

Figure 6. 

Illustration of the construction process of the Weisfeiler–Lehman subtree kernel with h = 1 for two graphs G3 and G3′. (A) The initial labeled graph G3 and G3′. (B) Augmented label on graph G3 and G3′. (C) Label compression. (D) Relabeled graph. (E) Computation of the kernel on graph G3 and G3′, where ϑ0 is the set of original node labels and ϑ1 the set of compressed node labels; ϕ(G3) and ϕ(G3′) are the count of node labels.