Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Application of GCN and R-GCN #176

Open
AmoghM opened this issue Jun 26, 2020 · 1 comment
Open

Application of GCN and R-GCN #176

AmoghM opened this issue Jun 26, 2020 · 1 comment

Comments

@AmoghM
Copy link

AmoghM commented Jun 26, 2020

I am new to the GCN research and was trying to differentiate which GCN is suitable for different problems. Here is what I think:

  1. GCN is useful for undirected graph
  2. GCN doesn't utilize edge attributes/features
  3. R-GCN is useful for directed graph
  4. R-GCN utilizes edge attributes/features.

I might be wrong but I really appreciate if you (@tkipf ) could clear this doubt for me. Thanks

@QasimWani
Copy link

GCN utilizes edge attributes. previous regularizing techniques consider node similarity, but GCN considers node features. its in the loss function (eq. 8 ). GCN can be used for directed graphs by constructing it as a bipartite graph. See https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/SDG.pdf for using bipartite graphs for learning on directed graphs

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants