Signed-PageRank: An Efficient Influence Maximization Framework for Signed Social Networks

Abstract

Influence maximization in social networks is of great importance for marketing new products. Signed social networks with both positive (friends) and negative (foes) relationships pose new challenges and opportunities, since the influence of negative relationships can be leveraged to promote information propagation. In this paper, we study the problem of influence maximization for advertisement recommendation in signed social networks. We propose a new framework to characterize the information propagation process in signed social networks, which models the dynamics of individuals beliefs and attitudes towards the advertisement based on recommendations from both positive and negative neighbours. To achieve influence maximization in signed social networks, we design a novel Signed-PageRank (SPR) algorithm, which selects the initial seed nodes by jointly considering their positive and negative connections with the rest of the network. Our extensive experimental results confirm that our proposed SPR algorithm can effectively and efficiently influence a broader range of individuals in the signed social networks than benchmark algorithms on both synthetic and real datasets.