Skip to main content
SpringerLink
Log in

Social network node influence maximization method combined with degree discount and local node optimization

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

Abstract

For the problem of maximizing the influence of nodes in traditional social networks, it is impossible to select nodes and spread the scope of large-scale diffusion simultaneously. Based on local node optimization and degree discount, a new node influence maximization algorithm is proposed (degree discount and local improvement method, DLIM). Firstly, the candidate seed set is optimized. The NAV (Node Approximate Influence Value) function is constructed to calculate the Influence Value of local Node. Determine nodes with similar influence value and select the source node; the similarity method is used to filter and delete nodes with similar influence value. Secondly, a node activation algorithm is proposed to filter candidate nodes with the idea of degree discount. DMAP (degree discount and maximum activation probability) is constructed. The function uses the filtered candidate nodes for global diffusion. Finally, the proposed DLIM algorithm is used to select the seed nodes to optimize the nodes, and the independent cascade propagation model is used to conduct comparative analysis experiments on four real data sets of Wiki-Vote, NetHEPT, NetPHY, and GrQc four real datasets, and with the Independent Cascade (IC). A comparative analysis experiment is carried out on the propagation model. The experimental results show that: the proposed DLIM algorithm improves the propagation range by 11.3% compared with the traditional degree discount algorithm. The time efficiency is four orders of magnitude faster than the traditional degree discount algorithm. The proposed DLIM algorithm is reasonable and effective. It can also be applied in network marketing, product recommendation, and other fields.

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

Similar content being viewed by others

References

  • Aldawish R, Kurdi H (2020) A modified degree discount heuristic for influence maximization in social networks. Procedia Comput Sci 170:311–316

    Article  Google Scholar 

  • Angell R, Schoenebeck G (2017) Don't be greedy: leveraging community structure to find high quality seed sets for influence maximization. In: 13th international conference on web & internet economics, pp 16–29

  • Chen W et al (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

  • Chen W et al (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1029–1038

  • Chen Y, Hu A, Hu X (2004) Evaluation method of node importance in communication network. J Commun 25:129–134

    Google Scholar 

  • Chen D, Lu L, Shang MS et al (2012) Identifying influential nodes in complex networks. NetPHYsical A Stat Mech Appl 391(4):1777–1787

    Article  Google Scholar 

  • Chen Y, Qu Q, Ying Y et al (2020) Semantics-aware influence maximization in social networks. Inf Sci 513:442–464

    Article  MathSciNet  Google Scholar 

  • Cheng J, Wu X, Zhou M et al (2018) A novel method for detecting new overlapping community in complex evolving networks. IEEE Trans Syst Man Cybern Syst 2018:1–13

    Google Scholar 

  • Cui L, Hu H, Yu S et al (2018) DDSE: A novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks. J Netw Comput Appl 103:119–130

    Article  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

  • Estrada E, Rodriguez-Velazquez JA (2005) Subgraph centrality in complex networks. Phys Rev E 71:056103

    Article  MathSciNet  Google Scholar 

  • Gao C, Gu S, Yang R et al (2020) Interaction-aware influence maximization and iterated sandwich method. Theoret Comput Sci 821:23–33

    Article  MathSciNet  Google Scholar 

  • Goldenberg J, Libai B, Muller E (2001) Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata. Acad Mark Sci Rev 2001:1–5

    Google Scholar 

  • 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 

  • Guo Q, Wang S, Wei Z, Chen M (2020) Influence maximization revisited: efficient reverse reachable set generation with bound tightened. In: ACM SIGMOD

  • Han K et al (2018) Efficient algorithms for adaptive influence maximization. Proceedings of the VLDB Endowment 11(9):1029–1040

    Article  Google Scholar 

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

  • Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. Theory Comput 6(4):137–214

    MATH  Google Scholar 

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

    Google Scholar 

  • Kitsak M, Gallos LK, Havlin S et al (2012) Identification of influential spreaders in diseases in complex networks. NetPHYsical Rev Lett 109(12):12–20

    Google Scholar 

  • Leskovec J, Krevl A (2016) SNAP[EB/OL]. 2016 [2016-3-10]. http://snap.stanford.edu/data.

  • Li Y et al (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852–1872

    Article  Google Scholar 

  • Li J, Cai T, Deng K et al (2020) Community-diversified influence maximization in social networks. Inf Syst 92:5–16

    Article  Google Scholar 

  • Lu X, Yu Z, Guo B et al (2014) Predicting the content dissemination trends by repost behavior modeling in mobile social networks. J Netw Comput Appl 42(3):197–207

    Article  Google Scholar 

  • Nguyen HT, Dinh TN, Thai MT (2018) Revisiting of 'revisiting the stop-and-stare algorithms for influence maximization'. In: CSoNet

  • Pei S et al (2017) Efficient collective influence maximization in cascading processes with first-order transitions. Sci Rep 7(1):45240

    Article  Google Scholar 

  • Peng S, Yu S, Yang A (2014) Smartphone malware and its propagation modeling: a survey. IEEE Commun Surv Tutor 16(2):925–941

    Article  Google Scholar 

  • Qiu L, Tian X, Sai S, Gu C (2019) LGIM: a global selection algorithm based on local influence for influence maximization in social networks. IEEE Access 8:4318–4328

    Article  Google Scholar 

  • 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

  • Tang Y, Shi Y, Xiao X (2015) Influence maximization in near–linear time: a martingale approach. In: Proceedings of the 15th ACM SIGMOD international conference, pp 1539–1554

  • J. Tang, X. Tang, X. Xiao, and J. Yuan (2018) Online Processing Algorithms for Influence Maximization. In: ACM SIGMOD

  • Vega-Oliveros DA, da Fontoura Costa L, Rodrigues FA (2020) Influence maximization by rumor spreading on correlated networks through community identification. Commun Nonlinear Sci Numer Simul 83:21–32

    Article  MathSciNet  Google Scholar 

  • Wang W, Street WN (2018) Modeling and maximizing influence diffusion in social networks for viral marketing. Appl Netw Sci 3(1):6–32

    Article  Google Scholar 

  • Wang X et al (2016) Bring order into the samples: A novel scalable method for influence maximization. IEEE Trans Knowl Data Eng 29(2):243–256

    Article  Google Scholar 

  • Wang Z, Yang Y, Pei J, Chu L, Chen E (2017) Activity maximization by effective information diffusion in social networks. IEEE Trans Knowl Data Eng 29(11):2374–2387

    Article  Google Scholar 

  • Zhao Z, Li C, Zhang X, Chiclana F, Viedma EH (2019) An incremental method to detect communities in dynamic evolving social networks. Knowl-Based Syst 163:404–415

    Article  Google Scholar 

  • Zhou Y, Zhang B, Sun X et al (2017) Analyzing and modeling dynamics of information diffusion in microblogging social network. J Netw Comput Appl 86:92–102

    Article  Google Scholar 

  • Zhou X, Zhang R, Yang K, Yang C, Huang T (2020) Using hybrid normalization technique and state transition algorithm to VIKOR method for influence maximization problem. Neurocomputing 410:41–50

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by National Social Science Fund of China (17XXW004).

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Chongqing University of Technology, Chongqing, 400054, China

    Xiaoyang Liu, Songyang Wu & Chao Liu

  2. School of Artificial Intelligence, Chongqing University of Technology, Chongqing, 401135, China

    Yihao Zhang

  3. School of Computing, National University of Singapore, Singapore, 119077, Singapore

    Yihao Zhang

Authors
  1. Xiaoyang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Songyang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chao Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yihao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoyang Liu.

Ethics declarations

Conflict of interest

The authors declare no conflict of interest.

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, X., Wu, S., Liu, C. et al. Social network node influence maximization method combined with degree discount and local node optimization. Soc. Netw. Anal. Min. 11, 31 (2021). https://doi.org/10.1007/s13278-021-00733-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13278-021-00733-3

Keywords

Search

Navigation