> Yes, you could simply take a non-symmetric adjacency matrix and normalize with D^(-1)*A instead of D^(-1/2)*A*D^(-1/2). Have a look at this paper for more details: https://arxiv.org/abs/1703.06103
In the code using Cora dataset, you have used a directed graph, which leads to a asymmetric adjacency matrix, but you made this matrix symmetric.
Could you please let me know why it should symmeteric matix?
And is it the same as making the graph directed and then find the adjacency matrix?
I have a similar question regarding citation relationships. While citation relationships are typically considered to be directed, in the paper, the links between nodes are treated as non-directed. I'm curious if there is a specific reason for this approach, or if it was simply done for the sake of simplicity.
I would greatly appreciate it if someone could provide a more detailed explanation on this matter.
Dear Dr Kipf,
In the code using Cora dataset, you have used a directed graph, which leads to a asymmetric adjacency matrix, but you made this matrix symmetric. Could you please let me know why it should symmeteric matix? And is it the same as making the graph directed and then find the adjacency matrix?
Thank you million for sharing your knowledge.
Originally posted by @fansariadeh in https://github.com/tkipf/gcn/issues/91#issuecomment-652734316
I have a similar question regarding citation relationships. While citation relationships are typically considered to be directed, in the paper, the links between nodes are treated as non-directed. I'm curious if there is a specific reason for this approach, or if it was simply done for the sake of simplicity.
I would greatly appreciate it if someone could provide a more detailed explanation on this matter.