Skip to main content
SpringerLink
Log in

Positive influence maximization in signed social networks under independent cascade model

  • Foundations
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

For existing methods for positive influence maximization in signed networks, two factors prevent them from getting high-quality results. First, very few researchers consider the critical effect of negative edges on influence propagation. Second, most of those methods use Monte Carlo simulation to estimate the influence propagating of each candidate seed set. Such time-consuming simulation process hinders the application of those methods in solving real-world problems. Motivated by these limitations, this study investigates the problem of positive influence maximization in competitive signed networks. First, an opposite influence propagating model is defined by a set of propagation rules, where negative links play a more critical role than the positive ones. Second, an influence propagation function is defined to estimate the positive influence propagating of a seed set. Using such influence propagation function, the process of simulation can be avoided, and the computation time can be reduced greatly. An algorithm is presented to select the seed nodes which can obtain the largest positive influence spreading in the signed network. The algorithm employs the greedy strategy to sequentially select the seed nodes according to their spreading increments, which are estimated by the influence propagation function. Experimental results on real-world social networks show that our algorithm consistently outperforms the state-of-the-art in terms of solution quality and is several orders of magnitude faster than other methods.

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

  • Ahmad YA, Ahmad KMB, Shahid R (2019) A trust model for analysis of trust, influence and their relationship in social network communities. Telemat Inform 36:94–116

    Google Scholar 

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

    Google Scholar 

  • 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(15):149–158

    Google Scholar 

  • Caliò A, Tagarelli A (2019) Complex influence propagation based on trust-aware dynamic linear threshold models. Appl Netw Sci 4:4. https://doi.org/10.1007/s41109-019-0124-5

    Article  Google Scholar 

  • Chen W, Collens A, Cummings R, Ke T, Liu Z, Rincon D, Sun X, Wang Y, Wei W, Yuan Y (2011) Influence maximization in social networks when negative opinions may emerge and propagate. In: The Proceedings of the 2011 SIAM international conference on data mining (SDM’2011), Mesa, Arizona, USA

  • Chen WB, Lei H, Qi K (2016) Lattice-based linearly homomorphic signatures in the standard model. Theor Comput Sci 634:47–54

    MathSciNet  MATH  Google Scholar 

  • Chiu CN, Yang CL (2019) Competitive advantage and simultaneous mutual influences between information technology adoption and service innovation: moderating effects of environmental factors. Struct Change Econ Dyn 49:192–205

    Google Scholar 

  • D’Angelo G, Severini L, Velaj Y (2019) Recommending links through influence maximization. Theor Comput Sci 764(11):30–41

    MathSciNet  MATH  Google Scholar 

  • 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

  • Fu GY, Chen F, Liu JG, Han JT (2019) Analysis of competitive information diffusion in a group-based population over social networks. Phys A 525:409–419

    Google Scholar 

  • Gao C, Su Z, Liu JM, Kurths J (2019) Even central users do not always drive information diffusion. Commun ACM 62(2):61–67

    Google Scholar 

  • He JS, Kaur H, Talluri M (2016) 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

  • Hosseini-Pozveh M, Zamanifar K, Naghsh-Nilchi AR (2019) Assessing information diffusion models for influence maximization in signed social networks. Expert Syst Appl 119(1):476–490

    Google Scholar 

  • 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

  • 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

  • Khomami MMD, Rezvanian A, Bagherpour N, Meybodi MR (2018) Minimum positive influence dominating set and its application in influence maximization: a learning automata approach. Appl Intell 48(3):570–593

    Google Scholar 

  • 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

  • Leskovec J (2017) Amazon fine foods reviews. http://snap.stanford.edu/data/web-FineFoods.html. Accessed 2019

  • Leskovec J (2018) RateBeer reviews. http://snap.stanford.edu/data/web-RateBeer.html. Accessed 2019

  • Leskovec J (2019) Epinions social network. http://snap.stanford.edu/data/soc-Epinions1.html. Accessed 2019

  • Li D, Wang CH, Zhang SP, Zhou GL, Chu DH, Wu C (2017) Positive influence maximization in signed social networks based on simulated annealing. Neurocomputing 260:69–78

    Google Scholar 

  • Li HJ, Pan L, Wu P (2018a) Dominated competitive influence maximization with time-critical and time-delayed diffusion in social networks. J Comput Sci 28:318–327

    MathSciNet  Google Scholar 

  • Li JH, Wang CD, Li PZ, Lai JH (2018b) Discriminative metric learning for multi-view graph partitioning. Pattern Recogn 75:199–213

    Google Scholar 

  • Li D, Wang W, Liu JM (2019) Grassroots VS elites: which ones are better candidates for influence maximization in social networks? Neurocomputing 358(17):321–331

    Google Scholar 

  • Liang WX, Shen CG, Li X, Nishid R, Piumarta I, Takada H (2019) Influence maximization in signed social networks with opinion formation. IEEE Access 7:68837–68852

    Google Scholar 

  • Lin YS, Lui JCS (2015) Analyzing competitive influence maximization problems with partial information: an approximation algorithmic framework. Perform Eval 91:187–204

    Google Scholar 

  • Liu WY, Yue K, Wu H, Li J, Liu DH, Tang DP (2016) Containment of competitive influence spread in social networks. Knowl Based Syst 109:266–275

    Google Scholar 

  • Liu W, Chen X, Jeon B, Chen L, Chen BL (2019) Influence maximization on signed networks under independent cascade model. Appl Intell 49(3):912–928

    Google Scholar 

  • Michael N, Reisinger Y, Hayes JP (2019) The UAE’s tourism competitiveness: a business perspective. Tourism Manag Perspect 30:53–64

    Google Scholar 

  • Pham CV, Ha DK, Ngo DQ, Vu QC, Hoang HX (2016a) A new viral marketing strategy with the competition in the large-scale online social networks. In: Proceedings of the IEEE RIVF international conference on computing and communication technologies, research, innovation, and vision for the future, pp 1–6

  • Pham CV, Thai MT, Ha D, Ngo DQ, Hoang HX (2016b) 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

  • Pham CV, Dinh HM, Nguyen HD, Dang HT, Hoang HX (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 (SoICT 2017), pp 262–269

  • Sela A, Goldenberg D, Ben-Gal I, Shmueli E (2018) Active viral marketing: incorporating continuous active seeding efforts into the diffusion model. Expert Syst Appl 107(1):45–60

    Google Scholar 

  • Shen CG, Nishide R, Piumarta I, Takada H, Liang WX (2015a) Influence maximization in signed social networks. In: Proceedings of the international conference on web information systems engineering (WISE), pp 399–414

  • Shen H, Gao CZ, He DB, Wu LB (2015b) New biometrics-based authentication scheme for multi-server environment in critical systems. J Ambient Intell Hum Comput 6(6):825–834

    Google Scholar 

  • Şimsek A, Kara R (2018) Using swarm intelligence algorithms to detect influential individuals for influence maximization in social networks. Expert Syst Appl 114:224–236

    Google Scholar 

  • Singh S S, Singh K, Kumar A, Biswas B (2019) Physica a: statistical mechanics and its applications, 526, Article 120902

  • Sun PG, Quan YN, Miao QG, Chi J (2018) Identifying influential genes in protein–protein interaction networks. Inf Sci 454:229–241

    MathSciNet  Google Scholar 

  • Talukder A, Alam MGR, Tran NH, Niyato D, Hong CS (2019) Knapsack-based reverse influence maximization for target marketing in social networks. IEEE Access 7:44182–44198

    Google Scholar 

  • Tanınmış K, Aras N, Altınel IK (2019) Influence maximization with deactivation in social networks. Eur J Oper Res 278(1):105–119

    MathSciNet  MATH  Google Scholar 

  • Tsai CW, Liu SJ (2019) SEIM: search economics for influence maximization in online social networks. Future Gener Comput Syst 93:1055–1064

    Google Scholar 

  • Wang F, Jiang WJ, Li XL, Wang GJ (2018) Maximizing positive influence spread in online social networks via fluid dynamics. Future Gener Comput Syst 86:1491–1502

    Google Scholar 

  • Wen YM, Wang CD, Lin KY (2019) Direction recovery in undirected social networks based on community structure and popularity. Inf Sci 473:31–43

    MathSciNet  Google Scholar 

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

  • Yang DD, Liao XW, Shen HW, Cheng XQ, Chen GL (2017) Relative influence maximization in competitive social networks. Sci China Inf Sci 60(10):108101

    Google Scholar 

  • Yu XC, Li R, Chu TG (2019) Effects of network structure on information diffusion reconstruction. IEEE Access 7:54834–54842

    Google Scholar 

  • Zhu LH, Zhou X, Li YM (2019) Global dynamics analysis and control of a rumor spreading model in online social networks. Phys A Stat Mech Appl 526, Article 120903

Download references

Acknowledgements

This research was supported in part by the Chinese National Natural Science Foundation under Grant Nos. 61379066, 61702441, 61070047, 61379064, 61472344, 61402395 and 61602202; Natural Science Foundation of Jiangsu Province under contracts BK20130452, BK2012672, BK2012128, BK20140492; and Natural Science Foundation of Education Department of Jiangsu Province under contract 12KJB520019, 13KJB520026, 09KJB20013. Six talent peaks project in Jiangsu Province (Grant No. 2011-DZXX-032).

Author information

Authors and Affiliations

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

    Jun Sheng, Ling Chen, Bin Li & Wei Liu

  2. School of Information Engineering, Yangzhou Polytechnic College, Yangzhou, China

    Jun Sheng

  3. Department of Computer Science, Washington University in St. Louis, St. Louis, USA

    Yixin Chen

Authors
  1. Jun Sheng
    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. Yixin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bin Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Wei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ling Chen.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical standard

All procedures performed in studies involving human participants were in accordance with the ethical standards of the institutional and/or national research committee and with the 1964 Helsinki Declaration and its later amendments or comparable ethical standards.

Ethical approval

This article does not contain any studies with animals performed by any of the authors.

Informed consent

Informed consent was obtained from all individual participants included in the study.

Additional information

Communicated by A. Di Nola.

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

Sheng, J., Chen, L., Chen, Y. et al. Positive influence maximization in signed social networks under independent cascade model. Soft Comput 24, 14287–14303 (2020). https://doi.org/10.1007/s00500-020-05195-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-05195-x

Keywords

Search

Navigation