Replies: 1 comment 4 replies
-
For undirected graphs, this is mostly covered in our link prediction example, see here. To convert this into link prediction example for directed graphs, one needs to replace the decoder to account for that, e.g., via: def decode(self, z, edge_label_index):
return self.MLP(torch.cat([z[edge_label_index[0], z[edge_label_index[1]], dim=-1)) Hope this helps :) |
Beta Was this translation helpful? Give feedback.
4 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
Uh oh!
There was an error while loading. Please reload this page.
-
Hi,
I am trying to classify if there is an edge between
A -> B
orB -> A
in a graph. However, I am not very sure how do I go about designing the model and the graph. Can you anyone please suggest some plausible route I can take?Thanks in advance!
Beta Was this translation helpful? Give feedback.
All reactions