Signed graph embedding via multi-order neighborhood feature fusion and contrastive learning.

Abstract

Signed graphs have been widely applied to model real-world complex networks with positive and negative links, and signed graph embedding has become a popular topic in the field of signed graph analysis. Although various signed graph embedding methods have been proposed, most of them still suffer from the generality problem. Namely, they cannot simultaneously achieve the satisfactory performance in multiple downstream tasks. In view of this, in this paper we propose a signed embedding method named MOSGCN which exhibits two significant characteristics. Firstly, MOSGCN designs a multi-order neighborhood feature fusion strategy based on the structural balance theory, enabling it to adaptively capture local and global structure features for more informative node representations. Secondly, MOSGCN is trained by using the signed graph contrastive learning framework, which further helps it learn more discriminative and robust node representations, leading to the better generality. We select link sign prediction and community detection as the downstream tasks, and conduct extensive experiments to test the effectiveness of MOSGCN on four benchmark datasets. The results illustrate the good generality of MOSGCN and the superiority by comparing to state-of-the-art methods.