Skip to main content
Springer Nature Link
Log in

Influence maximization based on maximum inner product search

  • S.I. : Deep Geospatial Data Understanding
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

In recent years, with the rapid development of social networks, the scale of social networks has grown dramatically. The relationship of people in social networks plays a key role in information propagation. Due to its huge social value, the issue of influence maximization has attracted more and more researchers’ attention. With the increase of network scale, the running time has become a key issue. To resolve it, many heuristic algorithms for the influence maximization problem has been proposed. These algorithms have been verified to be be very efficient, but their effectiveness cannot be guaranteed for many networks in the real word. Therefore, it has become highly urgent to choose an influence maximization algorithm that is simultaneously efficient and effective. This paper proposes an algorithm based on the greedy algorithm framework, which converts the influence maximization problem into a maximum inner product search problem. This method can complete the selection of seed nodes for large-scale networks in nearly linear time. Compared with other algorithms, this algorithm has more application value.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. AskariSichani O, Jalili M (2015) Influence maximization of informed agents in social networks. Appl Math Comput 254:229–239

    MATH  Google Scholar 

  2. Shishir B, David K, Mahyar S (2007) Competitive influence maximization in social networks. In International workshop on web and internet economics, pp 306–311. Springer,

  3. Christian B, Michael B, Jennifer C, Brendan L (2014) Maximizing social influence in nearly optimal time. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pp 946–957. SIAM,

  4. Brin S, Page L (2012) Reprint of: The anatomy of a large-scale hypertextual web search engine. Comput Netw 56(18):3825–3833

    Article  Google Scholar 

  5. Chen D, Lü L, Shang M-S, Zhang Y-C, Zhou T (2012) Identifying influential nodes in complex networks. Physica A: Stat Mech Appl 391(4):1777–1787

    Article  Google Scholar 

  6. Chen S, Yin X, Cao Q, Li Q, Long H (2020) Targeted influence maximization based on cloud computing over big data in social networks. IEEE Access 8:45512–45522

    Article  Google Scholar 

  7. Wei C, Chi W, Yajun W (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,

  8. Pedro D, Matt R (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,

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

  10. 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 9(3):1–18

    Google Scholar 

  11. Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83(6):1420–1443

    Article  Google Scholar 

  12. David K, Jon K, Éva T (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,

  13. Jure L, Andreas K, Carlos G, Christos F, Van Briesen J, Natalie G (2007) Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 420–429,

  14. Li X, Cheng X, Su S, Sun C (2018) Community-based seeds selection algorithm for location aware influence maximization. Neurocomput 275:1601–1613

    Article  Google Scholar 

  15. Shang J, Zhou S, Li X, Liu L, Wu H (2017) Cofim: A community-based framework for influence maximization on large-scale networks. Knowl-Based Syst 117:88–100

    Article  Google Scholar 

  16. Anshumali S, Ping L (2014) Asymmetric lsh (alsh) for sublinear time maximum inner product search (mips). arXiv preprint arXiv:1405.5869,

  17. Youze T, Yanchen S, Xiaokui X (2015) Influence maximization in near-linear time: A martingale approach. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp 1539–1554,

  18. Youze T, Xiaokui X, Yanchen S (2014) Influence maximization: Near-optimal time complexity meets practical efficiency. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pp 75–86,

  19. Guangmo T, Ruiqi W, Zheng D, Xiang L (2020) Time-constrained adaptive influence maximization. IEEE Trans Comput Soc Syst

  20. Wang X, Zhang Y, Zhang W, Lin X (2016) Efficient distance-aware influence maximization in geo-social networks. IEEE Trans Knowl Data Eng 29(3):599–612

    Article  Google Scholar 

  21. Yang J, Liu J (2017) Influence maximization-cost minimization in social networks based on a multiobjective discrete particle swarm optimization algorithm. IEEE Access 6:2320–2329

    Article  Google Scholar 

  22. Chao D, Jingdong W (2014) Inner product similarity search using compositional codes. arXiv preprint arXiv:1406.4966,

  23. Peng H, Zhongxiao L, Yong L, Peilin Z, Jing L, Hao W, Shuo S (2020) Contextualized point-of-interest recommendation. International Joint Conferences on Artificial Intelligence Organization,

  24. Youn J, Shim J, Lee S-J (2018) Efficient data stream clustering with sliding windows based on locality-sensitive hashing. IEEE Access 6:63757–63776

    Article  Google Scholar 

  25. Junzhou Z, Shuo S, Pinghui W, John CSL, Xiangliang Z (2019) Tracking influential nodes in time-decaying dynamic interaction networks. In 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp 1106–1117. IEEE,

Download references

Author information

Authors and Affiliations

  1. Northeastern University, NO. 3-11, Wenhua Road, Heping District, Shenyang, People’s Republic of China

    Zeguang Liu, Yao Li & Huilin Liu

Authors
  1. Zeguang Liu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Yao Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Huilin Liu
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Huilin Liu.

Ethics declarations

Conflict of interest

We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work, there is no professional or other personal interest of any nature or kind in any product, service and/or company that could be construed as influencing the position presented in, or the review of, the manuscript entitled.

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, Z., Li, Y. & Liu, H. Influence maximization based on maximum inner product search. Neural Comput & Applic 35, 3605–3613 (2023). https://doi.org/10.1007/s00521-021-06595-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-021-06595-2

Keywords