Hi everyone !
I am currently working with GraphSAGE module from dgl and I run some tests on GraphSAGE. Firstly, how does graphSAGE works when a node has no neighbours ? Since he cant aggregate the informations from his neighbours, he can’t compute its embedding ?
Secondly, I have tried to run graphSAGE on a small graph where there is only isolated nodes with differents features information about the nodes, and GraphSAGE does not return a fixed embedding for each isolated node. Is it normal or am i misunderstanding an elemnt of GraphSAGE algorithm ?
Thank you all !