canqin001 / efficient_graph_similarity_computation Goto Github PK

Hi,

I am a little confused about Eq.(4). Could you explain why the attention layer is designed as Eq.(4), and the motivation of skip connection, i.e., '+h_{ij}', in Eq.(4)?

An additional question is in the code implementation, such as line 137, the \varphi is set to tanh, but in the paper, it is set to a sigmoid gating. Besides, in the paper, the graph-level embedding h is computed based on the original node features X， but in the code implementation, it is computed based on the attention-transformed features as line 151.