Representing Bipartite graphs with concatenated features #10264
Unanswered
ebrahimpichka
asked this question in
Q&A
Replies: 0 comments
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.
-
Hello PyG team/community,
I have issues with working with bipartite graphs that i'd appreciate your help with.
Suppose we have two separate sets of nodes which form our Undirected Bipartite graph i.e.$V = ( V_{src}, V_{dst} ) $ .
The docs mention that
First question
My first question is, would it make a difference if we just construct one graph with (x_N, x_M) stacked together and make sure that node indices of
dst
starts after that ofsrc
. Like:Second question
If there is indeed a difference, what's the advantage of separating
src
anddst
for conv layers?Also, is there an example of how using the
x=(x_N, x_M)
method works? i mean the entire steps of preparing the data, defining the network, propagation, etc.Beta Was this translation helpful? Give feedback.
All reactions