/Polarity Related Influence Maximization in Signed Social Networks

Polarity Related Influence Maximization in Signed Social Networks

Dong Li, Zhi-Ming Xu, Nilanjan Chakraborty, Anika Gupta, Katia Sycara and Quansheng Liang
Journal Article, PLoS ONE 9(7): e102199. doi:10.1371/journal.pone.0102199, January, 2014

Download Publication (PDF)

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

Influence maximization in social networks has been widely studied motivated by applications like spread of ideas or innovations in a network and viral marketing of products. Current studies focus almost exclusively on unsigned social networks containing only positive relationships (e.g. friend or trust) between users. Influence maximization in signed social networks containing both positive relationships and negative relationships (e.g. foe or distrust) between users is still a challenging problem that has not been studied. Thus, in this paper, we propose the polarity-related influence maximization (PRIM) problem which aims to find the seed node set with maximum positive influence or maximum negative influence in signed social networks. To address the PRIM problem, we first extend the standard Independent Cascade (IC) model to the signed social networks and propose a Polarity-related Independent Cascade (named IC-P) diffusion model. We prove that the influence function of the PRIM problem under the IC-P model is monotonic and submodular Thus, a greedy algorithm can be used to achieve an approximation ratio of 1-1/e for solving the PRIM problem in signed social networks. Experimental results on two signed social network datasets, Epinions and Slashdot, validate that our approximation algorithm for solving the PRIM problem outperforms state-of-the-art methods.

BibTeX Reference
@article{Li-2014-17184,
author = {Dong Li and Zhi-Ming Xu and Nilanjan Chakraborty and Anika Gupta and Katia Sycara and Quansheng Liang},
title = {Polarity Related Influence Maximization in Signed Social Networks},
journal = {PLoS ONE 9(7): e102199. doi:10.1371/journal.pone.0102199},
year = {2014},
month = {January},
}
2017-09-13T10:39:05+00:00