Back to Search
Start Over
Polarity Related Influence Maximization in Signed Social Networks.
- Source :
- PLoS ONE; Jul2014, Vol. 9 Issue 7, p1-12, 12p
- Publication Year :
- 2014
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- CELL polarity
SOCIAL networks
APPLIED mathematics
SOCIAL sciences
PHYSICAL sciences
Subjects
Details
- Language :
- English
- ISSN :
- 19326203
- Volume :
- 9
- Issue :
- 7
- Database :
- Complementary Index
- Journal :
- PLoS ONE
- Publication Type :
- Academic Journal
- Accession number :
- 97361275
- Full Text :
- https://doi.org/10.1371/journal.pone.0102199