Computing accuracy with a RandomNodeLoader
#8393
-
Hi! I have a question about how My understanding is that we sample nodes and compute their induced subgraph with a certain partition, but how are these partitions computed? Is it just we compute the subgraph until we hit a target number of nodes? Doesn't this mean that nodes near the edges of the subgraph will have fewer neighbors than those originally sampled? Is this why the sampled strategy differs substantially from performing inference on the entire dataset? Is the code in Thanks in advance for your time :) My code:
|
Beta Was this translation helpful? Give feedback.
Replies: 1 comment
-
Ah it turns out I was misinterpreting what an induced subgraph was and because I wasn't shuffling my data I was getting a subgraph with pretty much all the same labels. Shuffling fixed the issue. |
Beta Was this translation helpful? Give feedback.
Ah it turns out I was misinterpreting what an induced subgraph was and because I wasn't shuffling my data I was getting a subgraph with pretty much all the same labels. Shuffling fixed the issue.