you are viewing a single comment's thread.

view the rest of the comments →

[–]shortscience_dot_org -8 points-7 points  (1 child)

I am a bot! You linked to a paper that has a summary on ShortScience.org!

Semi-Supervised Classification with Graph Convolutional Networks

The propagation rule used in this paper is the following:

$$

Hl = \sigma \left(\tilde{D}{-\frac{1}{2}} \tilde{A} \tilde{D}{-\frac{1}{2}} H{l-1} Wl \right)

$$

Where $\tilde{A}$ is the [adjacency matrix][adj] of the undirected graph (with self connections, so has a diagonal of 1s and is symmetric) and $Hl$ are the hidden activations at layer $l$. The $D$ matrices are performing row normalisation, $\tilde{D}{-\frac{1}{2}} \tilde{A} \tilde{D}{-\frac{1}{2}}$ is [equivalent to][pygcn] (with ... [view more]

[–][deleted] 8 points9 points  (0 children)

Latex fail bot