Skip to main content
SpringerLink
Log in

Multi-Round Influence Maximization: A Variable Neighborhood Search Approach

  • Conference paper
  • First Online:
Variable Neighborhood Search (ICVNS 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13863))

Included in the following conference series:

Abstract

The study of Social Network Influence has attracted the interest of scientists. The wide variety of real-world applications of this area, such as viral marketing and disease analysis, highlights the relevance of designing an algorithm capable of solving the problem efficiently. This paper studies the Multiple Round Influence Maximization (MRIM) problem, in which influence is propagated in multiple rounds independently from possibly different seed sets. This problem has two variants: the non-adaptive MRIM, in which the advertiser needs to determine the seed sets for all rounds at the beginning, and the adaptive MRIM, in which the advertiser can select the seed sets adaptively based on the propagation results in the previous rounds. The main difficulty of this optimization problem lies in the computational effort required to evaluate a solution. Since each node is infected with a certain probability, the value of the objective function must be calculated through an influence diffusion model, which results in a computationally complex process. For this purpose, a metaheuristic algorithm based on Variable Neighborhood Search is proposed with the aim of providing high-quality solutions, being competitive with the state of the art.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aghaee, Z., Ghasemi, M.M., Beni, H.A., Bouyer, A., Fatemi, A.: A survey on meta-heuristic algorithms for the influence maximization problem in the social networks. Computing 103(11), 2437–2477 (2021). https://doi.org/10.1007/s00607-021-00945-7

    Article  MathSciNet  MATH  Google Scholar 

  2. Banerjee, S., Jenamani, M., Pratihar, D.K.: A survey on influence maximization in a social network. Knowl. Inf. Syst. 62(9), 3417–3455 (2020). https://doi.org/10.1007/s10115-020-01461-4

    Article  Google Scholar 

  3. Barbieri, N., Bonchi, F., Manco, G.: Topic-aware social influence propagation models. In: 2012 IEEE 12th International Conference on Data Mining. pp. 81–90 (2012). https://doi.org/10.1109/ICDM.2012.122

  4. Berger, J.: Word of mouth and interpersonal communication: A review and directions for future research. J. Consum. Psychol. 24(4), 586–607 (2014). https://doi.org/10.1016/j.jcps.2014.05.002

    Article  Google Scholar 

  5. Chen, N.: On the approximability of influence in social networks. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms. p. 1029–1037. SODA ’08, Society for Industrial and Applied Mathematics, USA (2008), https://dl.acm.org/doi/10.5555/1347082.1347195

  6. D’angelo, A., Agarwal, A., Jin, K.X., Juan, Y.F., Klots, L., Moskalyuk, O., Wong, Y.: Targeting advertisements in a social network (Mar 2009), uS Patent App. 12/195,321

    Google Scholar 

  7. Duarte, A., Pantrigo, J.J., Pardo, E.G., Mladenović, N.: Multi-objective variable neighborhood search: an application to combinatorial optimization problems. J. Global Optim. 63(3), 515–536 (2014). https://doi.org/10.1007/s10898-014-0213-z

    Article  MathSciNet  MATH  Google Scholar 

  8. Golovin, D., Krause, A.: Adaptive submodularity: Theory and applications in active learning and stochastic optimization. J. Artif. Intell. Res. 42 (2010). https://doi.org/10.48550/arXiv.1003.3967

  9. Goyal, A., Lu, W., Lakshmanan, L.V.S.: CELF++: Optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web - WWW ’11. ACM Press (2011). https://doi.org/10.1145/1963192.1963217

  10. Hansen, P., Mladenović, N., Brimberg, J., Pérez, J.A.M.: Variable Neighborhood Search, pp. 61–86. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-1665-5_3

  11. Hansen, P., Mladenović, N., Pérez, J.A.M.: Variable neighbourhood search: methods and applications. Annals of Operations Research 175(1), 367–407 (oct 2009). https://doi.org/10.1007/s10479-009-0657-6

  12. Kempe, D., Kleinberg, J., Tardos, É.: 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 (2003). https://doi.org/10.1145/956750.956769

  13. Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. Theory Comput. 11(1), 105–147 (2015). https://doi.org/10.4086/toc.2015.v011a004

    Article  MathSciNet  MATH  Google Scholar 

  14. Khalil, E., Dilkina, B., Song, L.: Cuttingedge: Influence minimization in networks. In: Proceedings of Workshop on Frontiers of Network Analysis: Methods, Models, and Applications at NIPS. pp. 1–13. Citeseer (2013)

    Google Scholar 

  15. King, S.F., Burgess, T.F.: Understanding success and failure in customer relationship management. Ind. Mark. Manage. 37(4), 421–431 (2008). https://doi.org/10.1016/j.indmarman.2007.02.005

    Article  Google Scholar 

  16. Klovdahl, A.S.: Social networks and the spread of infectious diseases: The AIDS example. Social Science & Medicine 21(11), 1203–1216 (1985). https://doi.org/10.1016/0277-9536(85)90269-2

    Article  Google Scholar 

  17. Lawyer, G.: Understanding the influence of all nodes in a network. Sci. Rep 5(1) (2015). https://doi.org/10.1038/srep08665

  18. Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. pp. 420–429 (2007). https://doi.org/10.1145/1281192.1281239

  19. Lin, S.C., Lin, S.D., Chen, M.S.: A learning-based framework to handle multi-round multi-party influence maximization on social networks. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. pp. 695–704 (2015). https://doi.org/10.1145/2783258.2783392

  20. Lozano-Osorio, I., Martínez-Gavara, A., Martí, R., Duarte, A.: Max-min dispersion with capacity and cost for a practical location problem. Expert Syst. Appl. 200, 116899 (2022). https://doi.org/10.1016/j.eswa.2022.116899

    Article  Google Scholar 

  21. Lozano-Osorio, I., Sánchez-Oro, J., Duarte, A., Cordón, Ó.: A quick GRASP-based method for influence maximization in social networks. J. Ambient. Intell. Humaniz. Comput. (2021). https://doi.org/10.1007/s12652-021-03510-4

    Article  Google Scholar 

  22. Lozano-Osorio, I., Sanchez-Oro, J., Rodriguez-Garcia, M.Á., Duarte, A.: Optimizing computer networks communication with the band collocation problem: A variable neighborhood search approach. Electronics 9(11), 1860 (2020). https://doi.org/10.3390/electronics9111860

    Article  Google Scholar 

  23. Luo, C., Cui, K., Zheng, X., Zeng, D.: Time critical disinformation influence minimization in online social networks. 2014 IEEE Joint Intelligence and Security Informatics Conference, pp. 68–74 (2014). https://doi.org/10.1109/JISIC.2014.20

  24. bibitemch9mork Martín, R., Cavero, S., Lozano Osorio, I.: rmartinsanta/mork: v0.13 (2022). https://doi.org/10.5281/ZENODO.6671107

  25. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997). https://doi.org/10.1016/S0305-0548(97)00031-2

    Article  MathSciNet  MATH  Google Scholar 

  26. Nguyen Hung, T., Thai My, T., Dinh Thang, N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 International Conference on Management of Data, pp. 695–710. SIGMOD 2016, Association for Computing Machinery, New York, NY, USA (2016). https://doi.org/10.1145/2882903.2915207

  27. Pérez-Peló, S., Sánchez-Oro, J., Martín-Santamaría, R., Duarte, A.: On the analysis of the influence of the evaluation metric in community detection over social networks. Electronics 8(1), 23 (2019). https://doi.org/10.3390/electronics8010023

    Article  Google Scholar 

  28. Pérez-Peló, S., Sánchez-Oro, J., Gonzalez-Pardo, A., Duarte, A.: A fast variable neighborhood search approach for multi-objective community detection. Appl. Soft Comput. 112, 107838 (2021). https://doi.org/10.1016/j.asoc.2021.107838

    Article  Google Scholar 

  29. Richardson, M., Domingos, P.: 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 (2002). https://doi.org/10.1145/775047.775057

  30. Sánchez-Oro, J., Pantrigo, J.J., Duarte, A.: Combining intensification and diversification strategies in VNS. an application to the vertex separation problem. Computers & Operations Research 52, 209–219 (Dec 2014). https://doi.org/10.1016/j.cor.2013.11.008

  31. Seeman, L., Singer, Y.: Adaptive seeding in social networks. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 459–468. IEEE (2013). https://doi.org/10.1109/focs.2013.56

  32. Stanley, W., Katherine, F.: Social Network Analysis. Cambridge University Press (Nov 1994). https://doi.org/10.1017/cbo9780511815478

  33. Sun, L., Huang, W., Yu, P.S., Chen, W.: Multi-round influence maximization. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2249–2258 (2018). https://doi.org/10.1145/3219819.3220101

  34. Sun, L., Huang, W., Yu, P.S., Chen, W.: Multi-round influence maximization (extended version). (2018). https://doi.org/10.48550/ARXIV.1802.04189

Download references

Acknowledgments

The authors acknowledge support from the Spanish Ministry of Ciencia, Innovación y Universidades under grant ref. PID2021-125709OA-C22 and PID2021-126605NB-I00, Comunidad de Madrid and Fondos Estructurales of the European Union with grant references S2018/TCS-4566, Y2018/EMT-5062.

Author information

Authors and Affiliations

  1. Universidad Rey Juan Carlos, Madrid, Spain

    Isaac Lozano-Osorio, Jesús Sánchez-Oro & Abraham Duarte

Authors
  1. Isaac Lozano-Osorio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jesús Sánchez-Oro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abraham Duarte
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Isaac Lozano-Osorio .

Editor information

Editors and Affiliations

  1. Khalifa University, Abu Dhabi, United Arab Emirates

    Andrei Sleptchenko

  2. University of Macedonia, Thessaloniki, Greece

    Angelo Sifaleras

  3. HEC Montréal, Montréal, QC, Canada

    Pierre Hansen

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lozano-Osorio, I., Sánchez-Oro, J., Duarte, A. (2023). Multi-Round Influence Maximization: A Variable Neighborhood Search Approach. In: Sleptchenko, A., Sifaleras, A., Hansen, P. (eds) Variable Neighborhood Search. ICVNS 2022. Lecture Notes in Computer Science, vol 13863. Springer, Cham. https://doi.org/10.1007/978-3-031-34500-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-34500-5_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-34499-2

  • Online ISBN: 978-3-031-34500-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation