IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i8p1341-d796152.html
   My bibliography  Save this article

Influence Maximization Based on Snapshot Prediction in Dynamic Online Social Networks

Author

Listed:
  • Lin Zhang

    (School of Computer Science, Beijing Institute of Technology, Beijing 100081, China)

  • Kan Li

    (School of Computer Science, Beijing Institute of Technology, Beijing 100081, China)

Abstract

With the vigorous development of the mobile Internet, online social networks have greatly changed the way of life of human beings. As an important branch of online social network research, influence maximization refers to finding K nodes in the network to form the most influential seed set, which is an abstract model of viral marketing. Most of the current research is based on static network structures, ignoring the important feature of network structures changing with time, which discounts the effect of seed nodes in dynamic online social networks. To address this problem in dynamic online social networks, we propose a novel framework called Influence Maximization based on Prediction and Replacement (IMPR). This framework first uses historical network snapshot information to predict the upcoming network snapshot and then mines seed nodes suitable for the dynamic network based on the predicted result. To improve the computational efficiency, the framework also adopts a fast replacement algorithm to solve the seed nodes between different snapshots. The scheme we adopted exhibits four advantages. First, we extended the classic influence maximization problem to dynamic online social networks and give a formal definition of the problem. Second, a new framework was proposed for this problem and a proof of the solution is given in theory. Third, other classical algorithms for influence maximization can be embedded into our framework to improve accuracy. More importantly, to reveal the performance of the scheme, a series of experiments based on different settings on real dynamic online social network datasets were carried out, and the experimental results are very promising.

Suggested Citation

  • Lin Zhang & Kan Li, 2022. "Influence Maximization Based on Snapshot Prediction in Dynamic Online Social Networks," Mathematics, MDPI, vol. 10(8), pages 1-20, April.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:8:p:1341-:d:796152
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/8/1341/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/8/1341/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Kumar, Ajay & Singh, Shashank Sheshar & Singh, Kuldeep & Biswas, Bhaskar, 2020. "Link prediction techniques, applications, and performance: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. J. Leonel Rocha & Sónia Carvalho & Beatriz Coimbra & Inês Henriques & Juliana Pereira, 2023. "Influence Maximization Dynamics and Topological Order on Erdös-Rényi Networks," Mathematics, MDPI, vol. 11(15), pages 1-18, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lin, Dan & Wu, Jiajing & Xuan, Qi & Tse, Chi K., 2022. "Ethereum transaction tracking: Inferring evolution of transaction networks via link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    2. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    3. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    4. Guanyi Wang, 2024. "Robust Network Targeting with Multiple Nash Equilibria," Papers 2410.20860, arXiv.org, revised Nov 2024.
    5. Rad Niazadeh & Negin Golrezaei & Joshua Wang & Fransisca Susan & Ashwinkumar Badanidiyuru, 2023. "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization," Management Science, INFORMS, vol. 69(7), pages 3797-3817, July.
    6. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    7. Alexandre D. Jesus & Luís Paquete & Arnaud Liefooghe, 2021. "A model of anytime algorithm performance for bi-objective optimization," Journal of Global Optimization, Springer, vol. 79(2), pages 329-350, February.
    8. Bin Liu & Miaomiao Hu, 2022. "Fast algorithms for maximizing monotone nonsubmodular functions," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1655-1670, July.
    9. repec:dgr:rugsom:99a17 is not listed on IDEAS
    10. Lehmann, Daniel, 2020. "Quality of local equilibria in discrete exchange economies," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 141-152.
    11. Michael Kahr & Markus Leitner & Ivana Ljubić, 2024. "The Impact of Passive Social Media Viewers in Influence Maximization," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1362-1381, December.
    12. Eric DuBois & Ashley Peper & Laura A. Albert, 2023. "Interdicting Attack Plans with Boundedly Rational Players and Multiple Attackers: An Adversarial Risk Analysis Approach," Decision Analysis, INFORMS, vol. 20(3), pages 202-219, September.
    13. Shengminjie Chen & Donglei Du & Wenguo Yang & Suixiang Gao, 2024. "Maximizing stochastic set function under a matroid constraint from decomposition," Journal of Combinatorial Optimization, Springer, vol. 48(1), pages 1-21, August.
    14. Yu, Jiating & Wu, Ling-Yun, 2022. "Multiple Order Local Information model for link prediction in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    15. Zhenning Zhang & Bin Liu & Yishui Wang & Dachuan Xu & Dongmei Zhang, 2022. "Maximizing a monotone non-submodular function under a knapsack constraint," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1125-1148, July.
    16. Charikhi, Mourad, 2024. "Association of the PageRank algorithm with similarity-based methods for link prediction in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 637(C).
    17. Wang, Feifei & Dong, Jiaxin & Lu, Wanzhao & Xu, Shuo, 2023. "Collaboration prediction based on multilayer all-author tripartite citation networks: A case study of gene editing," Journal of Informetrics, Elsevier, vol. 17(1).
    18. Zhenning Zhang & Donglei Du & Yanjun Jiang & Chenchen Wu, 2021. "Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint," Journal of Global Optimization, Springer, vol. 80(3), pages 595-616, July.
    19. Awi Federgruen & Nan Yang, 2008. "Selecting a Portfolio of Suppliers Under Demand and Supply Risks," Operations Research, INFORMS, vol. 56(4), pages 916-936, August.
    20. Yingfei Wang & Inbal Yahav & Balaji Padmanabhan, 2024. "Smart Testing with Vaccination: A Bandit Algorithm for Active Sampling for Managing COVID-19," Information Systems Research, INFORMS, vol. 35(1), pages 120-144, March.
    21. Chenggang Wang & Zengfu Wang & Xiong Xu & Yuhang Hao, 2021. "A balanced sensor scheduling for multitarget localization in a distributed multiple-input multiple-output radar network," International Journal of Distributed Sensor Networks, , vol. 17(7), pages 15501477211, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:8:p:1341-:d:796152. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.