Skip to main content
SpringerLink
Log in

An algorithm for influence maximization in competitive social networks with unwanted users

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

With the rapid development of online social networks, the problem of influence maximization (IM) has attracted tremendous attention motivated by widespread application scenarios. However, there is less research focusing on the information spreading with the existence of some unwanted users. Such problem has a wide range of applications since there always exist conflicts of interest between competing businesses. In this paper, we formally define the problem of influence maximization with limited unwanted users (IML) under the independent cascade model. In order to avoid the time-consuming process of simulating the propagation in the traditional method of influence maximization, we propose a propagation path based strategy to compute the activation probabilities between the node pairs. Based on the activation probability, we define a propagation increment function to avoid simulating the influence spreading process on the candidate seed nodes. To select the optimal seed set, we present a greedy algorithm to sequentially select the nodes which can maximize the influence increment to join the seed set. Experimental results in real social networks have shown that the algorithm proposed not only outperforms the existing methods but also consumes much less computation time.

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
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Qiang J-P, Li Y, Yuan Y-H, Wu X-D (2018a) Short text clustering based on pitman-yor process mixture model. Appl Intell 48:1802–1812

    Article  Google Scholar 

  2. Qiang J-P, Li Y, Yuan Y-H, Liu W (2018b) Snapshot ensembles of non-negative matrix factorization for stability of topic modeling. Appl Intell 48(11):3963–3975

    Article  Google Scholar 

  3. García-Díaz V, Espada JP, Crespo RG, G-Bustelo BCP, Lovelle JMC (2018) An approach to improve the accuracy of probabilistic classifiers for decision support Systems in Sentiment Analysis. Appl Soft Comput 67:822–833

    Article  Google Scholar 

  4. Magdin M, Prikler F (2018) Are instructed emotional states suitable for classification? Demonstration of how they can significantly influence the classification result in an automated recognition system. IJIMAI 5:1–7. https://doi.org/10.9781/ijimai.2018.03.002

  5. Mochón MC (2016) Social network analysis and big data tools applied to the systemic risk supervision. IJIMAI 3(6):34–37

  6. Mondragon VM, García-Díaz V, Porcel V, Crespo RG (2018) Adaptive contents for interactive TV guided by machine learning based on predictive sentiment analysis of data. Soft Comput 22(8):2731–2752

    Article  Google Scholar 

  7. Núñez XMG, Núñez -Valdez ER, Pascua J (2018) A proposal for sentiment analysis on twitter for tourism-based applications. In: Proceedings of the 17th international conference on intelligent software methodologies, tools, and techniques (SOMET), vol 303, pp 713–722

    Google Scholar 

  8. 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

    Chapter  Google Scholar 

  9. 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

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  11. Gomez-Rodriguez, M., Song, L., Du, N., Zha, H.-Y, and Schölkopf, B.(2016). Influence Estimation and Maximization in Continuous Time Diffusion Networks. ACM Transcaton on Information System, 34(2), 1-33.

  12. Shen C-G, Nishide R, Piumarta I, Takada H, Liang W-X (2015) Influence maximization in signed social networks. In proceedings of the international conference on web information. Syst Eng:399–414

  13. 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, 3580 (2), (pp.1127–1138)

  14. 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

    Google Scholar 

  15. Zhuang H-L, Sun Y-H, Tang J, Zhang J-L, Sun X-M (2013) Influence maximization in dynamic social networks. In: Proceedings of IEEE international conference on data mining, pp 1313–1318

    Google Scholar 

  16. Chen W, Lu W, Zhang N (2015) Time-critical influence maximization in social networks with time-delayed diffusion process. In: Proceedings of the twenty-sixth AAAI conference on artificial intelligence, pp 592–598

    Google Scholar 

  17. Shi T, Wan J-L, Cheng S-Y, Cai Z-P, Li Y-S, Li J (2015) Time-bounded positive influence in social networks. In: Proceedings of the international conference on identification, Information & Knowledge in the internet of things, pp 134–139

    Google Scholar 

  18. Du N, Liang Y-Y, Balcan M-F, Manuel G-R, Zha H-Y, Le S (2017) Scalable influence maximization for multiple products in continuous-time diffusion networks. J Mach Learn Res 18:1–45

    MathSciNet  MATH  Google Scholar 

  19. Guo J, Zhang P, Zhou C, Cao Y-N, Guo L (2011) Personalized influence maximization on social networks. In: Proceedings of the 22nd ACM international conference on conference on information and knowledge management, pp 199–208

    Google Scholar 

  20. Pham CV, Dung KH, Dung QN, Quang CV, Hoang H-X (2016b) A New Viral Marketing Strategy with the Competition in the Large-Scale Online Social Networks. In: Proceedings of the 12th IEEE-RIVF International Conference on Computing & Communication Technologies, pp 1–6

    Google Scholar 

  21. Bozorgi A, Haghighi H, Zahedi MS, Rezvani M (2016) INCIM: a community-based algorithm for influence maximization problem under the linear threshold model. Inf Process Manag 52:1188–1199

    Article  Google Scholar 

  22. He J, Kaur H, Talluri M (2015) Positive opinion influential node set selection for social networks: considering both positive and negative relationships. In: Proceedings of the wireless communications, networking and applications, pp 935–948

    Google Scholar 

  23. Weng X, Liu Z-B, Li Z-Y (2016) An efficient influence maximization algorithm considering both positive and negative relationships. In: Proceedings of the IEEE Trustcom/BigDataSE/ISPA, pp 1931–1936

    Google Scholar 

  24. Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: Proceedings of international workshop on web and internet economics, pp 306–311

    Google Scholar 

  25. Carnes T, Nagarajan C, Wild SM, Zuylen AV (2007) Maximizing influence in a competitive social network: a follower's perspective. In: Proceedings of the ninth international conference on electronic commerce, pp 351–360

    Google Scholar 

  26. Borodin A, Filmus A, Oren J (2010) Threshold models for competitive influence in social networks. In: Proceedings of international workshop on internet and network economics, pp 539–550

    Chapter  Google Scholar 

  27. Zhang H-Y, Dinh TN, Thai MT (2013) Maximizing the spread of positive influence in online social networks. In: Proceedings of the IEEE international conference on distributed computing systems, pp 317–326

    Google Scholar 

  28. Petz G, Karpowicz M, Fürschuß H, Auinger A, Stříteský V, Holzinger A (2015) Computational approaches for mining User's opinions on the web 2.0. Inf Process Manag 51(4):510–519

    Article  Google Scholar 

  29. Jendoubi S, Martin A, Li’etard L, Hadji HB, Yaghlane BB (2016) Maximizing positive opinion influence using an evidential approach. Artif Intell:168–174

  30. Li H, Bhowmick SS, Cui J-T, Gao Y-J, Ma J-F (2015) Towards realistic selection of influence maximization strategies in competitive networks. In: Proceedings of the ACM SIGMOD international conference on Management of Data, pp 1525–1537

    Google Scholar 

  31. Kermani MAMA, Ardestani SFF, Aliahmadi A, Barzinpour F (2017) A novel game theoretic approach for modeling competitive information diffusion in social networks with heterogeneous nodes, vol 466, pp 570–582

    MATH  Google Scholar 

  32. Zhang Z, Shi Y-S, Willson J, Du D-Z, Tong G-M (2017) Viral marketing with positive influence. In: Proceedings of IEEE conference on computer communications, pp 1–8

    Google Scholar 

  33. Yang D-D, Liao X-W, Shen H-W, Cheng X-Q, Chen G-L (2017) Relative influence maximization in competitive social networks. SCIENCE CHINA Inf Sci 60(10):108101

    Article  Google Scholar 

  34. Lu W, Chen W, Lakshmanan LVS (2015) From competition to complementarity: comparative influence diffusion and maximization. In: Proceedings of the VLDB Endowment, vol 9, pp 60–71

    Google Scholar 

  35. Zhu Y-Q, Li D-Y, Zhang Z (2016) Minimum cost seed set for competitive social influence. In: proceedings of the 35th annual IEEE international conference on Comput Commun, vol 80, pp 1–9

    Google Scholar 

  36. Yu Y, Jia J-L, Li D-Y, Zhu Y-Q (2017) Fair Multi-influence Maximization in Competitive Social Networks. In: Proceedings of International Conference on Wireless Algorithms, Systems, and Applications, pp 253–265

    Chapter  Google Scholar 

  37. Bozorgi A, Samet S, Kwisthout J, Wareham T (2017) Community-based influence maximization in social networks under a competitive linear threshold model. Knowl-Based Syst 134:149–158

    Article  Google Scholar 

  38. Ceren B, Divyakant A, Abbadi AEI (2011) Limiting the spread of misinformation in social networks. In: Proceedings of the 20 the international conference on world wide web, pp 665–674

    Google Scholar 

  39. Pham CV, Hoang H-X, Manh MV (2015) Preventing and detecting infiltration on online social networks. In: Proceedings of the 4th international conference on computational social networks, pp 60–73

    Chapter  Google Scholar 

  40. Zhang H, Li X, Thai M (2015) Limiting the spread of misinformation while effectively raising awareness in social networks. In: Proceedings of the 4th international conference on computational social networks, pp 35–47

    Chapter  Google Scholar 

  41. Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):1–41

    Article  Google Scholar 

  42. Tang L, Liu H (2009) Relational learning via latent social dimensions. In: Proceedings of the 15th ACM SIGKDD conference on knowledge discovery and data mining, pp 817–826

    Chapter  Google Scholar 

  43. Adamic LA, Glance N (2005) The political blogosphere and the 2004 U.S. election:divided they blog. In: Proceedings of the international workshop on link discovery, pp 36–43

    Chapter  Google Scholar 

  44. Pham CV, Dinh HM, Nguyen HD, Dang HY, Hoang H-X (2017) Limiting the spread of epidemics within time constraint on online social networks. In: Proceedings of the eighth international symposium on information and communication technology, pp 262–269

    Google Scholar 

  45. Canh, V. P., My, T.T., Dung, H., Dung, Q. N., and Huan, X. H. (2016). Time-Critical Viral Marketing Strategy with the Competition on Online Social Networks. In: Proceedings of the 5th International Conference on Computational Social Networks (CSoNet 2016), LNCS 9795, pp.111–122, 2016.

  46. Lu F, Zhang W-K, Shao L-W, Jiang X-F, Xu P, Jin H(2017). Scalable Influence Maximization under Independent Cascade Model. J Netw Comput Appl 86:15–23

  47. Manuel G-R, Le S, Nan D, Hongyuan Z, Bernhard S, (2016) Influence Estimation and Maximization in Continuous-Time Diffusion Networks. ACM Transactions on Information Systems 34 (2):1–33

Download references

Acknowledgments

This research was supported in part by the Chinese National Natural Science Foundation under Grant Nos. 61702441, 61772454, 61703362, 61602202, Natural Science Foundation of Jiangsu Province under contracts BK20170513, BK20160428, and the Blue Project of Yangzhou University.

Author information

Authors and Affiliations

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

    Wei Liu, Ling Chen & Xin Chen

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

    Wei Liu & Bolun Chen

Authors
  1. Wei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ling Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bolun Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Liu.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, W., Chen, L., Chen, X. et al. An algorithm for influence maximization in competitive social networks with unwanted users. Appl Intell 50, 417–437 (2020). https://doi.org/10.1007/s10489-019-01506-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-019-01506-4

Keywords

Search

Navigation