How does SAGEConv works?

[aure_bnp]

Hi everyone, I am crrently working with GraphSAGE algorithm, and I am using SAGEConv() module from the dgl library.

I have several questions:

1. Does the aggregator_type = pool performs a maxpooling or a minpooling ?
2. Can SAGEConv be applied on directed graph such as this one ?
   
   
3. If I can apply it to this kind of graphs, do I have to put a self loop on all the nodes to perform graphSAGE as the authors mentionned or is it better if it remains without self loop ?

Thank you a lot for your help and response !
Have a nice day !

[minjie]

Hi,

@aure_bnp

Does the aggregator_type = pool performs a maxpooling or a minpooling ?

maxpooling

@aure_bnp

Can SAGEConv be applied on directed graph such as this one ? If I can apply it to this kind of graphs, do I have to put a self loop on all the nodes to perform graphSAGE as the authors mentionned or is it better if it remains without self loop ?

It can because SAGEConv will incorporate both the embeddings from neighbors and the embeddings from the node itself, so it is similar to having self loops in the graph.

[aure_bnp]

Thank you a lot for your answer ! @minjie