Signed random walk diffusion for effective representation learning in signed graphs.

How can we model node representations to accurately infer the signs of missing edges in a signed social graph? Signed social graphs have attracted considerable attention to model trust relationships between people. Various representation learning methods such as network embedding and graph convolutional network (GCN) have been proposed to analyze signed graphs. However, existing network embedding models are not end-to-end for a specific task, and GCN-based models exhibit a performance degradation issue when their depth increases. In this paper, we propose S i gned D iffusion N et work (S id N et ), a novel graph neural network that achieves end-to-end node representation learning for link sign prediction in signed social graphs. We propose a new random walk based feature aggregation, which is specially designed for signed graphs, so that S id N et effectively diffuses hidden node features and uses more information from neighboring nodes. Through extensive experiments, we show that S id N et significantly outperforms state-of-the-art models in terms of link sign prediction accuracy.

Abstract licence: CC BY

34 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.