A Capsule Network-based Model for Learning Node Embeddings
Table 5: Accuracy results on the Cora validation sets w.r.t each data split and each value m>1 of routing iterations for the transductive and inductive settings. Regarding Algorithm 1 when m>1, “Ours” denotes our update rule (bi←^u(i)vi⋅ev), while “Sab.” denotes the update rule (bi←bi+^u(i)vi⋅ev) originally used by sabour2017dynamic .
['Split', '[BOLD] Transductive  [ITALIC] m=3', '[BOLD] Transductive  [ITALIC] m=3', '[BOLD] Transductive  [ITALIC] m=5', '[BOLD] Transductive  [ITALIC] m=5', '[BOLD] Transductive  [ITALIC] m=7', '[BOLD] Transductive  [ITALIC] m=7', '[BOLD] Inductive  [ITALIC] m=3', '[BOLD] Inductive  [ITALIC] m=3', '[BOLD] Inductive  [ITALIC] m=5', '[BOLD] Inductive  [ITALIC] m=5', '[BOLD] Inductive  [ITALIC] m=7', '[BOLD] Inductive  [ITALIC] m=7']
Therefore, we propose to use the new update rule (bi←^u(i)vi⋅ev) as this new rule generally helps obtain a higher performance for each setup. w.r.t each data split and each value m>1 of routing iterations.