Skip to main content
SpringerLink
Log in

Scalable influence maximization based on influential seed successors

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

Abstract

Influence maximization is a fundamental problem, which is aimed to specify a small subset of individuals as the seed set to influence the individuals as much as possible under a certain influence cascade model. Most existing works on influence maximization assume that all of the seeds would like to spread the designated information. However, in reality, a small number of the seeds may be unwilling to spread this information, which may waste unnecessary resources. Thus, it is important for us to find a series of successors to replace these useless seeds. To deal with this challenge, we put forward a new method, which utilizes the degree discount algorithm to find the original seed set firstly. Moreover, we design a candidate selection strategy to select a large number of candidate seeds combining the largest degree nodes and the neighbors of removed nodes. At last, by optimizing the combination of original seeds and candidate seeds, our algorithm can select the combination of the most influential seeds by simulated annealing method. Furthermore, exhaustive experiments demonstrate that our proposal performs better than the other conventional algorithms in the aspects of influence spread and running 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

Similar content being viewed by others

References

  • Abdulfattah FH (2019) Factors affecting students’ intention toward mobile cloud computing: mobile cloud computing. Int J Cloud Appl Comput 9(2):28–42

    Google Scholar 

  • Arora N, Banati H (2018) IM-GSO: a community directed group search optimization approach for influence maximization. Cybern Syst 49(7-8):497–520

    Article  Google Scholar 

  • Bagheri E, Dastghaibyfard G, Hamzeh A (2018) FSIM: a fast and scalable influence maximization algorithm based on community detection. Int J Uncertain Fuzz Knowl Based Syst 26(3):379–396

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Cao JX, Dong D, Xu S et al (2015) A k-core based algorithm for influence maximization in social networks. Chin J Comput 38(2):1–7

    MathSciNet  Google Scholar 

  • Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining, New York, NY, USA, pp 199–208

  • Chen W, Yuan Y, Zhang L (2011) Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the international conference on data mining. IEEE, Sydney, Australia, pp 88–97

  • Chen D, Linyuan L, Shang M-S, Zhang Y-C, Zhou T (2012) Identifying influential nodes in complex networks. Phys A 391(4):1777–1787

    Article  Google Scholar 

  • Chen YC, Zhu WY, Peng WC et al (2014) CIM: community-based influence maximization in social networks. ACM Trans Intell Syst Technol 5(2):1–31

    Article  Google Scholar 

  • Cheng S, Shen H, Huang J et al (2014) IMRank: influence maximization via finding self-consistent ranking, pp 475–484

  • Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the KDD, New York, NY, USA, pp 57–66

  • Gao S, Ma J, Chen Z, Wang G, Xing C (2014) Ranking the spreading capability of nodes in complex networks based on local structure. Phys A 403(2014):130–147

    Article  MATH  Google Scholar 

  • Gao Y, Wang X, Wang L (2017) A platform for reshaping organizational networks. In: Proceedings of China control conference, Dalian, China, pp 11278–11283

  • Huang H, Shen H, Meng Z et al (2019) Community-based influence maximization for viral marketing. Appl Intell 49(5):1–14

    Google Scholar 

  • Jiang Q, Song G, Cong G et al (2011) Simulated annealing based influence maximization in social networks. In: Proceedings of the twenty-fifth AAAI conference on artificial intelligence, AAAI, San Francisco, CA, USA, pp 127–132

  • Jung K, Heo W, Chen W (2013) IRIE: scalable and robust influence maximization in social networks. In: Proceedings of the IEEE international conference on data mining. IEEE, Washington, DC, USA

  • Kempe D, Kleinberg J (2003) Maximizing the spread of influence through a social network. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining, New York, NY, USA, pp 137–146

  • Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888–893

    Article  Google Scholar 

  • Leskovec J et al (2007) Cost-effective outbreak detection in networks. In: Proceedings of KDD, New York, NY, USA, pp 420–429

  • Li CT, Hsieh HP, Lin SD, Shan MK (2012) Finding influential seed successors in social networks. In: Proceedings of the 21st international conference on world wide web. ACM, New York, NY, USA, pp 557–558

  • Li X, Cheng X, Su S et al (2018) Community-based seeds selection algorithm for location-aware influence maximization. Neurocomputing 275(2018):88–100

    Google Scholar 

  • Liu Q, Xiang B, Chen E et al (2014) Influence maximization over large-scale social networks: a bounded linear approach. In: Proceedings of the KDD, Shang Hai, China, pp 171–180

  • Liu YY, Guo JF, Jiang JW (2018) A hybrid algorithm for influence maximization. Sci Technol Eng 18(7):179–184

    Google Scholar 

  • Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (2004) Equation of state calculations by fast computing machines. J Chem Phys 21(2004):1087–1092

    MATH  Google Scholar 

  • Nguyen DL, Nguyen TH, Do TH (2017) Probability-based multi-hop diffusion method for influence maximization in social networks. Wirel Person Commun 93(4):903–916

    Article  Google Scholar 

  • Purohit M, Prakash BA, Kang C et al (2014) Fast influence-based coarsening for large networks. ACM, New York, pp 1296–1305

    Google Scholar 

  • Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the KDD, New York, NY, USA, pp 61–70

  • Sambrekar K (2019) Fast and efficient multiview access control mechanism for cloud based agriculture storage management system. Int J Cloud Appl Comput 9(1):33–49

    Google Scholar 

  • Shang J, Zhou S, Li X et al (2016) CoFIM: a community-based framework for influence maximization on large-scale networks. Knowl Based Syst 117:88–100

    Article  Google Scholar 

  • Shang J, Wu H, Zhou S, Zhong J, Feng Y, Qiang B (2018) IMPC: influence maximization based on multi-neighbor potential in community networks. Phys A Stat Mech Appl 512(15):1085–1103

    Article  Google Scholar 

  • Tang J, Tang X, Yuan J (2018) An efficient and effective hop-based approach for influence maximization in social networks. Soc Netw Anal Min 8(1):10

    Article  Google Scholar 

  • Wang Y (2010) Community-based greedy algorithm for mining top-K influential nodes in mobile social networks. In: ACM Sigkdd international conference on knowledge discovery & data mining. ACM, Washington, DC, USA, pp 1039–1048

  • Wang S, Li B, Liu X et al (2015) An influence maximization algorithm of boundary nodes based on the degree of community. Appl Electron Tech 41(5):145–148

    Google Scholar 

  • Wang X, Zhang Y, Zhang W et al (2017) Bring order into the samples: a novel scalable method for influence maximization. IEEE Trans Knowl Data Eng 29(2):243–256

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This paper is supported by the Nature Science Foundation of China (No. 61976126).

Author information

Authors and Affiliations

  1. Shandong Province Key Laboratory of Wisdom Mine Information Technology, College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, 266590, China

    Sun Chengai, Niu Weinan, Qiu Liqing & Lv Liangyu

Authors
  1. Sun Chengai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Niu Weinan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qiu Liqing
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lv Liangyu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qiu Liqing.

Ethics declarations

Conflict of interest

We confirm that the manuscript has been read and approved by all named authors and that there are no other persons who satisfied the criteria for authorship but are not listed. We further confirm that the order of authors listed in the manuscript has been approved by all of us.

Additional information

Communicated by B. B. Gupta.

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

Chengai, S., Weinan, N., Liqing, Q. et al. Scalable influence maximization based on influential seed successors. Soft Comput 24, 5921–5931 (2020). https://doi.org/10.1007/s00500-019-04483-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-019-04483-5

Keywords

Search

Navigation