Semi-supervised Gated Spectral Convolution on a Directed Signed Network

A complex network is a powerful tool that enables a complex system in the real world to be represented as a network structure. Due to the heterogeneous edges and nodes implying rich semantic information, network representation has received considerable attention in both research and industrial domai...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access 2020-01, Vol.8, p.1-1
Hauptverfasser: Cui, Jiancong, Zhuang, Hui, Liu, Taoran, Wang, Hong
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A complex network is a powerful tool that enables a complex system in the real world to be represented as a network structure. Due to the heterogeneous edges and nodes implying rich semantic information, network representation has received considerable attention in both research and industrial domain. Over the recent years, the graph convolutional network (GCN) has provided a novel approach for learning network embeddings. However, this primarily supports undirected unsigned networks; that is, it cannot be directly applied to directed signed networks because it is challenging to effectively depict the direction and signs of edges in such models. In this paper, we therefore propose a method for semi-supervised gated spectral convolution in directed signed networks.We first extend the concept of the GCN to directed signed networks, which not only preserves the advantages of the traditional GCN but also properly describes the significance of the directions and signs of the edges. We then innovatively define sign (label) propagation rules in directed signed networks, rendering the networks semi-supervised. Furthermore, we enhance the balance theory to constrain the process of sign propagation to obtain network embedding with better interpretability. To satisfy the needs of large-scale complex networks, we propose a gating mechanism to adaptively forget sign information, which significantly reduces the time-space complexity of the sign propagation process. Finally, we compare the proposed method with state-of-the-art baselines using four real-world data sets for the classical link sign prediction task. Experimental results demonstrate that the proposed method is competitive.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2020.2979865