Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Survey on Influence Maximization: From an ML-Based Combinatorial Optimization (2211.03074v1)

Published 6 Nov 2022 in cs.SI and cs.LG

Abstract: Influence Maximization (IM) is a classical combinatorial optimization problem, which can be widely used in mobile networks, social computing, and recommendation systems. It aims at selecting a small number of users such that maximizing the influence spread across the online social network. Because of its potential commercial and academic value, there are a lot of researchers focusing on studying the IM problem from different perspectives. The main challenge comes from the NP-hardness of the IM problem and #P-hardness of estimating the influence spread, thus traditional algorithms for overcoming them can be categorized into two classes: heuristic algorithms and approximation algorithms. However, there is no theoretical guarantee for heuristic algorithms, and the theoretical design is close to the limit. Therefore, it is almost impossible to further optimize and improve their performance. With the rapid development of artificial intelligence, the technology based on Machine Learning (ML) has achieved remarkable achievements in many fields. In view of this, in recent years, a number of new methods have emerged to solve combinatorial optimization problems by using ML-based techniques. These methods have the advantages of fast solving speed and strong generalization ability to unknown graphs, which provide a brand-new direction for solving combinatorial optimization problems. Therefore, we abandon the traditional algorithms based on iterative search and review the recent development of ML-based methods, especially Deep Reinforcement Learning, to solve the IM problem and other variants in social networks. We focus on summarizing the relevant background knowledge, basic principles, common methods, and applied research. Finally, the challenges that need to be solved urgently in future IM research are pointed out.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (138)
  1. A survey on meta-heuristic algorithms for the influence maximization problem in the social networks. Computing 103, 11 (2021), 2437–2477.
  2. Boosting reinforcement learning in competitive influence maximization with transfer learning. In 2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI). IEEE, 395–400.
  3. Leveraging transfer learning in reinforcement learning to tackle competitive influence maximization. Knowledge and Information Systems (2022), 1–32.
  4. Addressing competitive influence maximization on unknown social network with deep reinforcement learning. In 2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE, 196–203.
  5. NEDRL-CIM: Network Embedding Meets Deep Reinforcement Learning to Tackle Competitive Influence Maximization on Evolving Social Networks. In 2021 IEEE 8th International Conference on Data Science and Advanced Analytics (DSAA). IEEE, 1–9.
  6. Deep reinforcement learning meets graph neural networks: Exploring a routing optimization use case. Computer Communications (2022).
  7. Hindsight experience replay. Advances in neural information processing systems 30 (2017).
  8. Sinan Aral and Paramveer S Dhillon. 2018. Social influence maximization under empirical influence models. Nature human behaviour 2, 6 (2018), 375–382.
  9. Debunking the myths of influence maximization: An in-depth benchmarking study. In Proceedings of the 2017 ACM international conference on management of data. 651–666.
  10. Online Topic-aware Influence Maximization Queries.. In EDBT. 295–306.
  11. New trends in influence maximization models. Computer Science Review 40 (2021), 100393.
  12. Neural machine translation by jointly learning to align and translate. In International Conference on Learning Representations.
  13. A survey on influence maximization in a social network. Knowledge and Information Systems 62, 9 (2020), 3417–3455.
  14. Albert-László Barabási. 2013. Network science. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 371, 1987 (2013), 20120375.
  15. Neural combinatorial optimization with reinforcement learning. In 5th International Conference on Learning Representations, ICLR, Workshop Track Proceedings.
  16. Machine learning for combinatorial optimization: a methodological tour d’horizon. European Journal of Operational Research 290, 2 (2021), 405–421.
  17. Dimitri P Bertsekas et al. 2011. Dynamic programming and optimal control 3rd edition, volume ii. Belmont, MA: Athena Scientific (2011).
  18. Competitive influence maximization in social networks. In International workshop on web and internet economics. Springer, 306–311.
  19. Maximizing social influence in nearly optimal time. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 946–957.
  20. Representation learning for information diffusion through social networks: an embedded cascade model. In Proceedings of the Ninth ACM international conference on Web Search and Data Mining. 573–582.
  21. Signature verification using a” siamese” time delay neural network. Advances in neural information processing systems 6 (1993).
  22. Spectral networks and deep locally connected networks on graphs. In 2nd International Conference on Learning Representations, ICLR 2014.
  23. Limiting the spread of misinformation in social networks. In Proceedings of the 20th international conference on World wide web. 665–674.
  24. Target-aware holistic influence maximization in spatial social networks. IEEE Transactions on Knowledge and Data Engineering (2020).
  25. A Survey on Location-Driven Influence Maximization. arXiv preprint arXiv:2204.08005 (2022).
  26. Combining reinforcement learning and constraint programming for combinatorial optimization. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 35. 3677–3687.
  27. Rich Caruana. 1997. Multitask learning. Machine learning 28, 1 (1997), 41–75.
  28. Influence blocking maximization on networks: Models, methods and applications. Physics Reports 976 (2022), 1–54.
  29. Contingency-aware influence maximization: A reinforcement learning approach. In Uncertainty in Artificial Intelligence. PMLR, 1535–1545.
  30. Graph neural network and reinforcement learning for multi-agent cooperative control of connected autonomous vehicles. Computer-Aided Civil and Infrastructure Engineering 36, 7 (2021), 838–857.
  31. Online topic-aware influence maximization. Proceedings of the VLDB Endowment 8, 6 (2015), 666–677.
  32. Graph Representation Learning for Popularity Prediction Problem: A Survey. Discrete Mathematics, Algorithms and Applications 14, 7 (2022), 2230003.
  33. Minimizing misinformation profit in social networks. IEEE Transactions on Computational Social Systems 6, 6 (2019), 1206–1218.
  34. ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning. arXiv preprint arXiv:2210.07500 (2022).
  35. Wei Chen. 2018. An issue in the martingale analysis of the influence maximization algorithm imm. In International Conference on Computational Social Networks. Springer, 286–297.
  36. Information and influence propagation in social networks. Synthesis Lectures on Data Management 5, 4 (2013), 1–177.
  37. 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. 1029–1038.
  38. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. 199–208.
  39. Scalable influence maximization in social networks under the linear threshold model. In 2010 IEEE international conference on data mining. IEEE, 88–97.
  40. Efficient similarity-aware influence maximization in geo-social network. IEEE Transactions on Knowledge and Data Engineering (2020).
  41. Information diffusion prediction via recurrent cascades convolution. In 2019 IEEE 35th international conference on data engineering (ICDE). IEEE, 770–781.
  42. IMRank: influence maximization via finding self-consistent ranking. In Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval. 475–484.
  43. Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In Proceedings of the 22nd ACM international conference on Information & Knowledge Management. 509–518.
  44. Empirical evaluation of gated recurrent neural networks on sequence modeling. arXiv preprint arXiv:1412.3555 (2014).
  45. Sketch-based influence maximization and computation: Scaling up with guarantees. In Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management. 629–638.
  46. Recommending links to maximize the influence in social networks. In IJCAI 2019: the 28th International Joint Conference on Artificial Intelligence, Macao, China, August 10-16, 2019, Vol. 4. AAAI Press/IJCAI, 2195–2201.
  47. Discriminative embeddings of latent variable models for structured data. In International conference on machine learning, ICML. 2702–2711.
  48. Minimum positive influence dominating set and its application in influence maximization: a learning automata approach. Applied Intelligence 48, 3 (2018), 570–593.
  49. Efficient network seeding under variable node cost and limited budget for social networks. Information Sciences 514 (2020), 369–384.
  50. Convolutional neural networks on graphs with fast localized spectral filtering. Advances in neural information processing systems 29 (2016).
  51. Learning heuristics for the tsp by policy gradient. In International conference on the integration of constraint programming, artificial intelligence, and operations research. Springer, 170–181.
  52. Pedro Domingos and Matt Richardson. 2001. Mining the network value of customers. In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. 57–66.
  53. metapath2vec: Scalable representation learning for heterogeneous networks. In Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining. 135–144.
  54. Least cost rumor blocking in social networks. In 2013 IEEE 33rd International Conference on Distributed Computing Systems. IEEE, 540–549.
  55. Curriculum-guided hindsight experience replay. Advances in neural information processing systems 32 (2019).
  56. Inf2vec: Latent representation model for social influence embedding. In 2018 IEEE 34th International Conference on Data Engineering (ICDE). IEEE, 941–952.
  57. An analysis of approximations for maximizing submodular set functions—II. In Polyhedral combinatorics. Springer, 73–87.
  58. Rossano Gaeta. 2018. A model of information diffusion in interconnected online social networks. ACM Transactions on the Web (TWEB) 12, 2 (2018), 1–21.
  59. Holistic influence maximization: Combining scalability and efficiency with opinion-aware models. In Proceedings of the 2016 International Conference on Management of Data. 743–758.
  60. Deep learning. MIT press.
  61. Learning influence probabilities in social networks. In Proceedings of the third ACM international conference on Web search and data mining. 241–250.
  62. Celf++ optimizing the greedy algorithm for influence maximization in social networks. In Proceedings of the 20th international conference companion on World wide web. 47–48.
  63. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In 2011 IEEE 11th international conference on data mining. IEEE, 211–220.
  64. Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining. 855–864.
  65. Information diffusion in online social networks: A survey. ACM Sigmod Record 42, 2 (2013), 17–28.
  66. Solving Dynamic Graph Problems with Multi-Attention Deep Reinforcement Learning. arXiv preprint arXiv:2201.04895 (2022).
  67. A multi-feature diffusion model: Rumor blocking in social networks. IEEE/ACM Transactions on Networking 29, 1 (2020), 386–397.
  68. Targeted protection maximization in social networks. IEEE Transactions on Network Science and Engineering 7, 3 (2019), 1645–1655.
  69. Jianxiong Guo and Weili Wu. 2021a. Adaptive influence maximization: if influential node unwilling to be the seed. ACM Transactions on Knowledge Discovery from Data 15, 5 (2021), 84:1–84:23.
  70. Jianxiong Guo and Weili Wu. 2021b. Continuous profit maximization: a study of unconstrained dr-submodular maximization. IEEE Transactions on Computational Social Systems 8, 3 (2021), 768–779.
  71. Influence maximization revisited: Efficient reverse reachable set generation with bound tightened. In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data. 2167–2181.
  72. Influence Maximization Revisited: Efficient Sampling with Bound Tightened. ACM Transactions on Database Systems 47, 3 (2022), 12:1–12:45.
  73. Inductive representation learning on large graphs. Advances in neural information processing systems 30 (2017).
  74. Reinforcement-learning-based competitive opinion maximization approach in signed social networks. IEEE Transactions on Computational Social Systems (2021).
  75. Graph Convolutional Network-Based Rumor Blocking on Social Networks. IEEE Transactions on Computational Social Systems (2022).
  76. John J Hopfield and David W Tank. 1985. “Neural” computation of decisions in optimization problems. Biological cybernetics 52, 3 (1985), 141–152.
  77. Recurrent neural variational model for follower-based influence maximization. Information Sciences 528 (2020), 280–293.
  78. Competitive and complementary influence maximization in social network: A follower’s perspective. Knowledge-Based Systems 213 (2021), 106600.
  79. Revisiting the stop-and-stare algorithms for influence maximization. Proceedings of the VLDB Endowment 10, 9 (2017), 913–924.
  80. David Ireland and Giovanni Montana. 2022. LeNSE: Learning To Navigate Subgraph Embeddings for Large-Scale Combinatorial Optimisation. In International Conference on Machine Learning, ICML, Vol. 162. 9622–9638.
  81. Deepdiffuse: Predicting the’who’and’when’in cascades. In 2018 IEEE international conference on data mining (ICDM). IEEE, 1055–1060.
  82. Myriam Jaouadi and Lotfi Ben Romdhane. 2019. Influence maximization problem in social networks: An overview. In 2019 IEEE/ACS 16th International Conference on Computer Systems and Applications (AICCSA). IEEE, 1–8.
  83. Simulated annealing based influence maximization in social networks. In Twenty-fifth AAAI conference on artificial intelligence.
  84. IM2Vec: Representation learning-based preference maximization in geo-social networks. Information Sciences 604 (2022), 170–196.
  85. An efficient graph convolutional network technique for the travelling salesman problem. arXiv preprint arXiv:1906.01227 (2019).
  86. Irie: Scalable and robust influence maximization in social networks. In 2012 IEEE 12th international conference on data mining. IEEE, 918–923.
  87. Influence Maximization in Unknown Social Networks: Learning Policies for Effective Graph Sampling. In Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems. 575–583.
  88. CIM: clique-based heuristic for finding influential nodes in multilayer networks. Applied Intelligence 52, 5 (2022), 5173–5184.
  89. Community aware random walk for network embedding. Knowledge-Based Systems 148 (2018), 47–54.
  90. Influence maximization across heterogeneous interconnected networks based on deep learning. Expert Systems with Applications 140 (2020), 112905.
  91. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. 137–146.
  92. Adversarial graph embeddings for fair influence maximization over social networks. In Proceedings of the 20th International Joint Conference on Artificial Intelligence, IJCAI. 4306–4312.
  93. Learning combinatorial optimization algorithms over graphs. Advances in neural information processing systems 30 (2017).
  94. Scalable diffusion-aware optimization of network topology. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. 1226–1235.
  95. Scalable and parallelizable processing of influence maximization for large-scale social networks?. In 2013 IEEE 29th international conference on data engineering (ICDE). IEEE, 266–277.
  96. Masahiro Kimura and Kazumi Saito. 2006. Tractable models for information diffusion in social networks. In European conference on principles of data mining and knowledge discovery. Springer, 259–271.
  97. Attention, Learn to Solve Routing Problems!. In International Conference on Learning Representations.
  98. Influence maximization in social networks using graph embedding and graph neural network. Information Sciences 607 (2022), 1617–1636.
  99. Influence maximization in social networks using transfer learning via graph-based LSTM. Expert Systems with Applications 212 (2023), 118770.
  100. Strip: stream learning of influence probabilities. In Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. 275–283.
  101. Eugene L Lawler and David E Wood. 1966. Branch-and-bound methods: A survey. Operations research 14, 4 (1966), 699–719.
  102. Identifying deep contrasting networks from time series data: Application to brain network analysis. In Proceedings of the 2017 SIAM International Conference on Data Mining. SIAM, 543–551.
  103. Online influence maximization. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 645–654.
  104. Graph colouring meets deep learning: Effective graph neural network models for combinatorial problems. In 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 879–885.
  105. Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. 420–429.
  106. Deepcas: An end-to-end predictor of information cascades. In Proceedings of the 26th international conference on World Wide Web. 577–586.
  107. CLAIM: Curriculum learning policy for influence maximization in unknown social networks. In Uncertainty in Artificial Intelligence. PMLR, 1455–1465.
  108. Efficient location-aware influence maximization. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data. 87–98.
  109. PIANO: Influence Maximization Meets Deep Reinforcement Learning. IEEE Transactions on Computational Social Systems (2022).
  110. Disco: Influence maximization meets network embedding and deep learning. arXiv preprint arXiv:1906.07378 (2019).
  111. Deep trajectory: a deep learning approach for mobile advertising in vehicular networks. Neural Computing and Applications 31, 7 (2019), 2813–2825.
  112. Influence maximization on social graphs: A survey. IEEE Transactions on Knowledge and Data Engineering 30, 10 (2018), 1852–1872.
  113. MAHE-IM: Multiple Aggregation of Heterogeneous Relation Embedding for Influence Maximization on Heterogeneous Information Network. Expert Systems with Applications 202 (2022), 117289.
  114. Real-time Targeted Influence Maximization for Online Advertisements. Proceedings of the VLDB Endowment 8, 10 (2015).
  115. Combinatorial optimization with graph convolutional networks and guided tree search. Advances in neural information processing systems 31 (2018).
  116. Continuous control with deep reinforcement learning. In Proceedings of 4th International Conference on Learning Representations. 1–14.
  117. 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. 695–704.
  118. Predicting Influence Probabilities using Graph Convolutional Networks. In 2019 IEEE International Conference on Big Data (Big Data). IEEE, 860–869.
  119. Influence maximization over large-scale social networks: A bounded linear approach. In Proceedings of the 23rd ACM international conference on conference on information and knowledge management. 171–180.
  120. An influence maximization algorithm based on low-dimensional representation learning. Applied Intelligence (2022), 1–18.
  121. Multiple Agents Reinforcement Learning Based Influence Maximization in Social Network Services. In International Conference on Service-Oriented Computing. Springer, 431–445.
  122. Adversarial Attack on Graph Neural Networks as An Influence Maximization Problem. In Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining. 675–685.
  123. Influence Maximization in Complex Networks by Using Evolutionary Deep Reinforcement Learning. IEEE Transactions on Emerging Topics in Computational Intelligence (2022).
  124. Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning. arXiv preprint arXiv:1911.04936 (2019).
  125. Gcomb: Learning budget-constrained combinatorial algorithms over billion-sized graphs. Advances in Neural Information Processing Systems 33 (2020), 20000–20011.
  126. Learning scheduling algorithms for data processing clusters. ACM SIGCOMM 2019 (2019).
  127. Sparsification of influence networks. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. 529–537.
  128. Controlling graph dynamics with reinforcement learning and graph neural networks. In International conference on machine learning, ICML. PMLR, 7565–7577.
  129. Efficient information diffusion in time-varying graphs through deep reinforcement learning. World Wide Web (2022), 1–26.
  130. Efficient estimation of word representations in vector space. In 1st International Conference on Learning Representations, ICLR 2013.
  131. Distributed representations of words and phrases and their compositionality. Advances in neural information processing systems 26 (2013).
  132. Human-level control through deep reinforcement learning. nature 518, 7540 (2015), 529–533.
  133. Kevin P Murphy. 2022. Probabilistic machine learning: an introduction. MIT press.
  134. Visual reinforcement learning with imagined goals. Advances in neural information processing systems 31 (2018).
  135. Ramasuri Narayanam and Yadati Narahari. 2010. A shapley value-based approach to discover influential nodes in social networks. IEEE Transactions on Automation Science and Engineering 8, 1 (2010), 130–147.
  136. Reinforcement learning for solving the vehicle routing problem. Advances in neural information processing systems 31 (2018).
  137. An analysis of approximations for maximizing submodular set functions—I. Mathematical programming 14, 1 (1978), 265–294.
  138. Least cost influence in multiplex social networks: Model representation and analysis. In 2013 IEEE 13th International Conference on Data Mining. IEEE, 567–576.
Citations (27)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now