Replies: 2 comments 1 reply
-
It looks like the best thing to do would be to create node features, like node degreee, node centrality etc. |
Beta Was this translation helpful? Give feedback.
0 replies
-
To follow-up on @wsad1, you can also learn an embedding matrix. This is identical to passing in the identity matrix but is actually more memory friendly, e.g.: embedding = torch.nn.Embedding(num_nodes, num_features)
def forward(self, n_id, edge_index):
x = embedding(n_id)
x = conv(x, edge_index) |
Beta Was this translation helpful? Give feedback.
1 reply
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.
-
So I am working on doing some research on link prediction but on the basis of the graphical structure only i.e. the only information I have is that nodes and edges of most of the GNN Link prediction examples have node features(ex data.x), what should I replace it with? I was thinking of replacing it with an identity matrix with dimensions being a number of nodes.
Also if you guys have any resources with link prediction that people are using their custom dataset instead of preloaded like CORA that would be really helpful
Thanks in Advance !
Beta Was this translation helpful? Give feedback.
All reactions