Skip to main content
SpringerLink
Log in

Influence maximization on signed networks under independent cascade model

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Influence maximization problem is to find a subset of nodes that can make the spread of influence maximization in a social network. In this work, we present an efficient influence maximization method in signed networks. Firstly, we address an independent cascade diffusion model in the signed network (named SNIC) for describing two opposite types of influence spreading in a signed network. We define the independent propagation paths to simulate the influence spreading in SNIC model. Particularly, we also present an algorithm for constructing the set of spreading paths and computing their probabilities. Based on the independent propagation paths, we define an influence spreading function for a seed as well as a seed set, and prove that the spreading function is monotone and submodular. A greedy algorithm is presented to maximize the positive influence spreading in the signed network. We verify our algorithm on the real-world large-scale networks. Experiment results show that our method significantly outperforms the state-of-the-art methods, particularly can achieve more positive influence spreading.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Brown JJ, Reingen PH (1987) Social ties and word-of-mouth referral behavior. J Consum Res 14(3):350–362

    Article  Google Scholar 

  2. Goldenberg J, Libai B, Muller E (2001) Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark Lett 12(3):211–223

    Article  Google Scholar 

  3. Goldenberg J, Libai B (2001) Using complex systems analysis to advance marketing theory development: modeling heterogeneity effects on new product growth through stochastic cellular automata. Academy Market Sci Rev 9(3):1–18

    Google Scholar 

  4. Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 57–66

  5. Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 61–70

  6. Ahmed NM, Chen L, Wang YL, Li B, Li Y, Liu W (2018) DeepEye: link prediction in dynamic networks based on non-negative matrix factorization. Big Data Mining Anal 1(1):19–33

    Article  Google Scholar 

  7. Kunegis J, Preusse J, Schwagereit F (2013) What is the added value of negative links in online social networks. In: Proceedings of the 22nd International Conference on World Wide Web, pp 727–736

  8. Lampe CAC, Johnston E, Resnick R (2007) Follow the reader: filtering comments on slashdot. In: Proceedings of the SIGCHI conference on human factors in computing systems, pp 1253–1262

  9. Wang Q, Jin Y, Lin Z, Cheng S, Yang T (2016) Influence maximization in social networks under an independent cascade-based model. Phys A: Stat Mech Appl 444:20–34

    Article  MathSciNet  MATH  Google Scholar 

  10. Li D, Wang C, Zhang S, Zhou G, Chu D, Wu C (2017) Positive influence maximization in signed social networks based on simulated annealing. Neurocomputing 260:69–78

    Article  Google Scholar 

  11. Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: Proceedings of the Internet and Network Economics, pp 306–311

  12. Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive influence in social networks. In: Proceedings of International Workshop on Internet and Network Economics, pp 539–550

  13. He X, Song G, Chen W, Jiang Q (2012) Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 12th SIAM International Conference on Data Mining, pp 463–474

  14. Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 137–146

  15. Kempe D, Kleinberg J, Tardos E (2005) Influential nodes in a diffusion model for social networks. In: Proceedings of the 32nd International Conference on Automata, Languages and Programming, vol 3580, pp 1127–1138

  16. Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. In: Proceedings of the European Conference on Principles of Data Mining and Knowledge Discovery, pp 259–271

  17. Leskovec J, Krause A, Guestrin C, et al. (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 420–429

  18. Goyal A, Lu W, Lakshmanan LVS (2011) CELF+ +: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web, pp 47–48

  19. Estevez PA, Vera P, Saito K (2007) Selecting the most influential nodes in social networks. In: Proceedings of the International Joint Conference on Neural Networks, pp 2397–2402

  20. Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: Proceedings of the International Workshop on Web and Internet Economics, pp 306–311

  21. Wu P, Pan L (2017) Scalable influence blocking maximization in social networks under competitive independent cascade models. Comput Netw 123:38–50

    Article  Google Scholar 

  22. Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 199–208

  23. Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the 10th IEEE International Conference on Data Mining, pp 88–97

  24. Li J, Yu Y (2012) Scalable influence maximization in social networks using the community discovery algorithm. In: Proceedings of the 2012 Sixth International Conference on Genetic and Evolutionary Computing, pp 284–287

  25. Zhu Y, Wu W, Bi Y et al (2015) Better approximation algorithms for influence maximization in online social networks. J Comb Optim 30(1):97–108

    Article  MathSciNet  MATH  Google Scholar 

  26. Mohammad M, Daliri K, Alireza R, Negin B, Mohammad RM (2018) Minimum positive influence dominating set and its application in influence maximization: a learning automata approach. Appl Intell 48:570–593

    Article  Google Scholar 

  27. Zeynep ZA, Sule GO (2018) Identifying topical influencers on twitter based on user behavior and network topology. Knowl-Based Syst 141:211–221

    Article  Google Scholar 

  28. Sumith N, Annappa B, Swapan B (2018) A holistic approach to influence maximization in social networks: STORIE. Appl Soft Comput 66:533–547

    Article  Google Scholar 

  29. Tang J, Tang X, Yuan J (2018) An efficient and effective hopbased approach for influence maximization in social networks. Soc Netw Anal Mining 8:10

    Article  Google Scholar 

  30. Gong M, Yan J, Shen B, Ma L, Cai Q (2016) Influence maximization in social networks based on discrete particle swarm optimization. Inform Sci 367-368:600–614

    Article  Google Scholar 

  31. Arastoo B, Hassan H, Mohammad SZ, Mojtaba R (2016) INCIM: A community-based algorithm for influence maximization problem under the linear threshold model. Inf Process Manag 52:1188–1199

    Article  Google Scholar 

  32. Zeng Y, Chen X, Cong G, Qin S, Tang J, Xiang Y (2016) Maximizing influence under influence loss constraint in social networks. Expert Syst Appl 55:255–267

    Article  Google Scholar 

  33. Lu F, Zhang W, Shao L, Jiang X, Xu P, Jin H (2017) Scalable influence maximization under independent cascade model. J Netw Comput Appl 86:15–23

    Article  Google Scholar 

  34. Du N, Liang Y, Maria FB, Manuel GR, Zha H, Song L (2017) Scalable influence maximization for multiple products in continuous-time diffusion networks. J Mach Learn Res 18:1–45

    MathSciNet  MATH  Google Scholar 

  35. Zhang H, Zhang H, Li X, My T (2015) Limiting the spread of misinformation while effectively raising awareness in social networks. In: Proceedings of the International Conference on Computational Social networks (CSonet), vol 9197. LNCS, pp 35–47

  36. Samadi M, Nagi R, Semenov A, Nikolaev A (2018) Seed activation scheduling for influence maximization in social networks. Omega 77:96–114

    Article  Google Scholar 

  37. Ajitesh S, Chelmis C, Viktor K (2015) Prasanna. Social Influence Computation and Maximization in Signed Networks with Competing Cascades. Proc IEEE/ACM Int Conf Advan Social Netw Anal Mining 89(14):41–48

    Google Scholar 

  38. Chen W, Collins A, Cummings R et al (2011) Influence maximization in social networks when negative opinions may emerge and propagate. In: Proceedings of the Eleventh SIAM International Conference on Data Mining, pp 379–390

  39. Chen S, He K (2015) Influence maximization on signed social networks with integrated PageRank. In: Proceedings of the IEEE International Conference on Smart City, pp 289–292

  40. Siwar J, Arnaud M, Ludovic L et al (2016) Maximizing positive opinion influence using an evidential approach[J]. Social Inform Netw:168–174

  41. Petz G et al (2015) Computational approaches for mining user’s opinions on the Web 2.0. Inform Process Manag 51(4):510–519

    Article  Google Scholar 

  42. Guimera R, Danon L, Diaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys Rev E Stat Nonlin Soft Matter Phys 68(6 Pt 2):065103

    Article  Google Scholar 

  43. Michalski R, Palus S, Kazienko P (2011) Matching organizational structure and social network extracted from email communication. Proc Int Conf Business Inform Syst 87:197–206

    Article  Google Scholar 

  44. Bogu M, Pastor-Satorras R, Díaz-guilera A, Arenas A (2004) Models of social networks based on social distance attachment. Phys. Rev. E 70(5):056122

    Article  Google Scholar 

  45. Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35–41

    Article  Google Scholar 

  46. Sabidussi G (1966) The centrality index of a graph. Psychometrika 31(4):581–603

    Article  MathSciNet  MATH  Google Scholar 

  47. Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the 28th ACM Conference on Human Factors in Computing Systems, pp 1–9

  48. Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD Conference on Knowledge Discovery. Springer, pp 1029–1038

  49. Shen C, Nishide R, Piumarta I, Takada H, Liang W (2015) Influence maximization in signed social networks. In: Proceedings of the 2015 International Conference on Web Information Systems Engineering. Springer, pp 399–414

  50. Page L, Brin S (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw 30 (1-7):107–117

    Google Scholar 

  51. Li Y, Chen W, Wang Y, Zhang Z (2013) Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In: Proceedings of the sixth ACM international conference on Web search and data mining, pp 657–666

  52. Li D, Xu Z, Chakraborty N, et al. (2014) Polarity related influence maximization in signed social networks. Plos One 9(7):e102199

    Article  Google Scholar 

Download references

Acknowledgments

This research was supported in part by the National Natural Science Foundation of China under Grant Nos. 61702441, 61602202, Natural Science Foundation of Jiangsu Province under contracts BK20160428.

Author information

Authors and Affiliations

  1. College of Information Engineering of Yangzhou University, Yangzhou, 225127, China

    Wei Liu, Xin Chen & Ling Chen

  2. The Laboratory for the Internet of Things and Mobile Internet Technology of Jiangsu Province, Huaiyin Institute of Technology, Huaiyin, 223002, China

    Wei Liu & Bolun Chen

  3. School of Electronic and Electrical Engineering, Sungkyunkwan University, Suwon, South Korea

    Wei Liu & Byeungwoo Jeon

Authors
  1. Wei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Byeungwoo Jeon
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ling Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bolun Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, W., Chen, X., Jeon, B. et al. Influence maximization on signed networks under independent cascade model. Appl Intell 49, 912–928 (2019). https://doi.org/10.1007/s10489-018-1303-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-018-1303-2

Keywords

Search

Navigation