An Attention-based Graph Neural Network (AGNN) as presented by Thekumparampil et al. (2018).
Mode: single, disjoint.
This layer expects a sparse adjacency matrix.
This layer computes: \mjdeqn Z = PX where \mjdeqn P_ij = \frac \exp \left( \beta \cos \left( X_i, X_j \right) \right) \sum\limits_k \in \mathcalN(i) \cup { i } \exp \left( \beta \cos \left( X_i, X_k \right) \right) and \mjeqn\beta is a trainable parameter.
Input
Node features of shape (N, F)
;
Binary adjacency matrix of shape (N, N)
.
Output
Node features with the same shape of the input.
1 | layer_agnn_conv(object, trainable = TRUE, activation = NULL, ...)
|
trainable |
boolean, if True, then beta is a trainable parameter. Otherwise, beta is fixed to 1 |
activation |
activation function to use |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.