Signed Network Node Embedding via Dual Attention Mechanism

Abstract

In signed networks, GNNs are used to get node embedding by aggregating node neighbor information. Most of the existing methods aggregate neighbor information from the node level, and the different paths between nodes and neighbors will also affect node embedding. The target node and its neighbors have different link positive,negative signs and link directions, which together constitute different paths.These different paths have different contributions to the target node.Based on the structural balance theory and status theory, this paper divides the different paths between nodes and their neighbors into 20 kinds of motifs, which are using to capture the different effects of paths on target nodes. Comprehensive consideration at the node level and path level, SNEDA (Signed Network Embedding via dual attention Mechanism) is proposed based on the graph attention Network. The model has two attention mechanisms: node-level attention captures different influences between nodes at the node level; path-level attention captures the different influences between motifs at the path level. The final vector representation of nodes is obtained by aggregating neighbor information selectively based on important motifs, and the vector representation is applied to link prediction. Experiments on four real social network data sets show that the network representation obtained by the model can improve the accuracy of link prediction. Experimental results demonstrate the effectiveness of the proposed framework through a signed link prediction task on four real-world signed network datasets.

Keywords

• Network embedding
• graph neural networks
• signed network
• graph attention
• link prediction