Advertisement

Applied Intelligence

, Volume 49, Issue 3, pp 912–928 | Cite as

Influence maximization on signed networks under independent cascade model

  • Wei LiuEmail author
  • Xin Chen
  • Byeungwoo Jeon
  • Ling Chen
  • Bolun Chen
Article
  • 86 Downloads

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.

Keywords

Influence maximization Independent cascade model Signed networks 

Notes

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.

References

  1. 1.
    Brown JJ, Reingen PH (1987) Social ties and word-of-mouth referral behavior. J Consum Res 14(3):350–362CrossRefGoogle Scholar
  2. 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–223CrossRefGoogle Scholar
  3. 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–18Google Scholar
  4. 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–66Google Scholar
  5. 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–70Google Scholar
  6. 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–33CrossRefGoogle Scholar
  7. 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–736Google Scholar
  8. 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–1262Google Scholar
  9. 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–34MathSciNetCrossRefzbMATHGoogle Scholar
  10. 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–78CrossRefGoogle Scholar
  11. 11.
    Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: Proceedings of the Internet and Network Economics, pp 306–311Google Scholar
  12. 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–550Google Scholar
  13. 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–474Google Scholar
  14. 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–146Google Scholar
  15. 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–1138Google Scholar
  16. 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–271Google Scholar
  17. 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–429Google Scholar
  18. 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–48Google Scholar
  19. 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–2402Google Scholar
  20. 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–311Google Scholar
  21. 21.
    Wu P, Pan L (2017) Scalable influence blocking maximization in social networks under competitive independent cascade models. Comput Netw 123:38–50CrossRefGoogle Scholar
  22. 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–208Google Scholar
  23. 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–97Google Scholar
  24. 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–287Google Scholar
  25. 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–108MathSciNetCrossRefzbMATHGoogle Scholar
  26. 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–593CrossRefGoogle Scholar
  27. 27.
    Zeynep ZA, Sule GO (2018) Identifying topical influencers on twitter based on user behavior and network topology. Knowl-Based Syst 141:211–221CrossRefGoogle Scholar
  28. 28.
    Sumith N, Annappa B, Swapan B (2018) A holistic approach to influence maximization in social networks: STORIE. Appl Soft Comput 66:533–547CrossRefGoogle Scholar
  29. 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:10CrossRefGoogle Scholar
  30. 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–614CrossRefGoogle Scholar
  31. 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–1199CrossRefGoogle Scholar
  32. 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–267CrossRefGoogle Scholar
  33. 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–23CrossRefGoogle Scholar
  34. 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–45MathSciNetzbMATHGoogle Scholar
  35. 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–47Google Scholar
  36. 36.
    Samadi M, Nagi R, Semenov A, Nikolaev A (2018) Seed activation scheduling for influence maximization in social networks. Omega 77:96–114CrossRefGoogle Scholar
  37. 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–48Google Scholar
  38. 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–390Google Scholar
  39. 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–292Google Scholar
  40. 40.
    Siwar J, Arnaud M, Ludovic L et al (2016) Maximizing positive opinion influence using an evidential approach[J]. Social Inform Netw:168–174Google Scholar
  41. 41.
    Petz G et al (2015) Computational approaches for mining user’s opinions on the Web 2.0. Inform Process Manag 51(4):510–519CrossRefGoogle Scholar
  42. 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):065103CrossRefGoogle Scholar
  43. 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–206CrossRefGoogle Scholar
  44. 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):056122CrossRefGoogle Scholar
  45. 45.
    Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35–41CrossRefGoogle Scholar
  46. 46.
    Sabidussi G (1966) The centrality index of a graph. Psychometrika 31(4):581–603MathSciNetCrossRefzbMATHGoogle Scholar
  47. 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–9Google Scholar
  48. 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–1038Google Scholar
  49. 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–414Google Scholar
  50. 50.
    Page L, Brin S (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw 30 (1-7):107–117Google Scholar
  51. 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–666Google Scholar
  52. 52.
    Li D, Xu Z, Chakraborty N, et al. (2014) Polarity related influence maximization in signed social networks. Plos One 9(7):e102199CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.College of Information Engineering of Yangzhou UniversityYangzhouChina
  2. 2.The Laboratory for the Internet of Things and Mobile Internet Technology of Jiangsu ProvinceHuaiyin Institute of TechnologyHuaiyinChina
  3. 3.School of Electronic and Electrical EngineeringSungkyunkwan UniversitySuwonSouth Korea

Personalised recommendations