Graph convolutional networks with the self-attention mechanism for adaptive influence maximization in social networks

Abstract

Listen

Translate article

The influence maximization problem that has drawn a great deal of attention from researchers aims to identify a subset of influential spreaders that can maximize the expected influence spread in social networks. Existing works on the problem primarily concentrate on developing non-adaptive policies, where all seeds will be ignited at the very beginning of the diffusion after the identification. However, in non-adaptive policies, budget redundancy could occur as a result of some seeds being naturally infected by other active seeds during the diffusion process. In this paper, the adaptive seeding policies are investigated for the intractable adaptive influence maximization problem. Based on deep learning model, a novel approach named graph convolutional networks with self-attention mechanism (ATGCN) is proposed to address the adaptive influence maximization as a regression task. A controlling parameter is introduced for the adaptive seeding model to make a tradeoff between the spreading delay and influence coverage. The proposed approach leverages the self-attention mechanism to dynamically assign importance weight to node representations efficiently to capture the node influence feature information relevant to the adaptive influence maximization problem. Finally, intensive experimental findings on six real-world social networks demonstrate the superiorities of the adaptive seeding policy over the state-of-the-art baseline methods to the conventional influence maximization problem. Meanwhile, the proposed adaptive seeding policy ATGCN improves the influence spread rate by up to 7% in comparison to the existing state-of-the-art greedy-based adaptive seeding policy.