A Topology Adaptive Graph Convolutional layer (TAG) as presented by Du et al. (2017).
Mode: single, disjoint.
This layer expects a sparse adjacency matrix.
This layer computes: \mjdeqn Z = \sum\limits_k=0^K D^-1/2A^kD^-1/2XW^(k)
Input
Node features of shape (N, F)
;
Binary adjacency matrix of shape (N, N)
.
Output
Node features with the same shape of the input, but the last dimension
changed to channels
.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
channels |
integer, number of output channels |
K |
the order of the layer (i.e., the layer will consider a K-hop neighbourhood for each node) |
activation |
activation function to use |
use_bias |
bool, add a bias vector to the output |
kernel_initializer |
initializer for the weights |
bias_initializer |
initializer for the bias vector |
kernel_regularizer |
regularization applied to the weights |
bias_regularizer |
regularization applied to the bias vector |
activity_regularizer |
regularization applied to the output |
kernel_constraint |
constraint applied to the weights |
bias_constraint |
constraint applied to the bias vector. |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.