arrow
Return

Signed directed attention network

delete2023-03-03
delete2
PRE
AI
Y
Yong Wu *
王斌君 cover
王斌君 (Binjun Wang)
W
Wei Li
W
Wenmao Liu
DOI:10.1007/s00607-023-01158-wdelete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Network embedding has facilitated lots of network analytical tasks by representing nodes as low-dimensional vectors. As an extension of convolutional neural networks from Euclidean data to irregular data, Graph Convolutional Networks (GCNs) provide a novel way to learn network representations and have attracted widespread attention currently. Most of the existing GCNs are only applied to unsigned networks. However, networks could have both positive and negative links in the real world, to which the unsigned algorithms are no longer applicable. In this paper, we propose a novel Signed Directed Attention Network model to capture the structural and social theoretical information of signed directed networks comprehensively through an auto-encoder framework. In the encoding block, the information of sign, direction, social theory, and bridge edges are encoded into node embeddings by a node fine-grained classification aggregation layer. Besides, a direction parameterization layer is also introduced to convert directions into direction-specific convolutional filters to enhance the node embeddings. In the decoding block, loss functions are designed to model sign, direction, bridge edge, and social theory information accordingly and make them complementary to each other to capture the network information fully. Experimental results for the signed link prediction task on several real-world signed directed graphs show that the proposed framework can achieve state-of-the-art performance.
Keywords:
Network embeddings
Graph convolutional networks
Attention mechanism
Signed link prediction

Journal

C
Computing
IF:
2.8
Papers:
2.3K
Citations:
3.5K

Organization

P
people's public security university of china
Scholars:
657
Papers: 414
Citations: 0