Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Online Influence Maximization: Concept and Algorithm (2312.00099v1)

Published 30 Nov 2023 in cs.SI and cs.LG

Abstract: In this survey, we offer an extensive overview of the Online Influence Maximization (IM) problem by covering both theoretical aspects and practical applications. For the integrity of the article and because the online algorithm takes an offline oracle as a subroutine, we first make a clear definition of the Offline IM problem and summarize those commonly used Offline IM algorithms, which include traditional approximation or heuristic algorithms and ML-based algorithms. Then, we give a standard definition of the Online IM problem and a basic Combinatorial Multi-Armed Bandit (CMAB) framework, CMAB-T. Here, we summarize three types of feedback in the CMAB model and discuss in detail how to study the Online IM problem based on the CMAB-T model. This paves the way for solving the Online IM problem by using online learning methods. Furthermore, we have covered almost all Online IM algorithms up to now, focusing on characteristics and theoretical guarantees of online algorithms for different feedback types. Here, we elaborately explain their working principle and how to obtain regret bounds. Besides, we also collect plenty of innovative ideas about problem definition and algorithm designs and pioneering works for variants of the Online IM problem and their corresponding algorithms. Finally, we encapsulate current challenges and outline prospective research directions from four distinct perspectives.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (106)
  1. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 137–146, 2003.
  2. Influence maximization on social graphs: A survey. IEEE Transactions on Knowledge and Data Engineering, 30(10):1852–1872, 2018a.
  3. Learning influence probabilities in social networks. In Proceedings of the third ACM international conference on Web search and data mining, pages 241–250, 2010.
  4. Influence function learning in information diffusion networks. In International Conference on Machine Learning, pages 2016–2024. PMLR, 2014.
  5. Learnability of influence in networks. Advances in Neural Information Processing Systems, 28, 2015.
  6. Learning diffusion using hyperparameters. In International Conference on Machine Learning, pages 2420–2428. PMLR, 2018.
  7. Learning opinions in social networks. In International Conference on Machine Learning, pages 2122–2132. PMLR, 2020.
  8. Network inference and influence maximization from samples. In International Conference on Machine Learning, pages 1707–1716. PMLR, 2021.
  9. Learning influence adoption in heterogeneous networks. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, pages 6411–6419, 2022.
  10. Multi-aspect diffusion network inference. In Proceedings of the ACM Web Conference 2023, pages 82–90, 2023.
  11. Online influence maximization. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 645–654, 2015.
  12. An analysis of approximations for maximizing submodular set functions—i. Mathematical programming, 14:265–294, 1978.
  13. 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, pages 1029–1038, 2010a.
  14. Scalable influence maximization in social networks under the linear threshold model. In 2010 IEEE international conference on data mining, pages 88–97. IEEE, 2010b.
  15. A survey on influence maximization: From an ml-based combinatorial optimization. ACM Transactions on Knowledge Discovery from Data, 17(9):133:1–133:50, 2023a.
  16. Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 420–429, 2007.
  17. Celf++ optimizing the greedy algorithm for influence maximization in social networks. In Proceedings of the 20th international conference companion on World wide web, pages 47–48, 2011a.
  18. On the upper bounds of spread for greedy algorithms in social network influence maximization. IEEE Transactions on Knowledge and Data Engineering, 27(10):2770–2783, 2015.
  19. Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 1039–1048, 2010.
  20. Simulated annealing based influence maximization in social networks. In Proceedings of the AAAI conference on artificial intelligence, volume 25, pages 127–132, 2011.
  21. Tractable models for information diffusion in social networks. In European conference on principles of data mining and knowledge discovery, pages 259–271. Springer, 2006.
  22. Scalable and parallelizable processing of influence maximization for large-scale social networks? In 2013 IEEE 29th international conference on data engineering (ICDE), pages 266–277. IEEE, 2013.
  23. Scalable influence maximization in social networks under the linear threshold model. In 2010 IEEE international conference on data mining, pages 88–97. IEEE, 2010c.
  24. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In 2011 IEEE 11th international conference on data mining, pages 211–220. IEEE, 2011b.
  25. Holistic influence maximization: Combining scalability and efficiency with opinion-aware models. In Proceedings of the 2016 international conference on management of data, pages 743–758, 2016.
  26. Maximizing social influence in nearly optimal time. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pages 946–957. SIAM, 2014.
  27. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 199–208, 2009.
  28. Influence maximization: Near-optimal time complexity meets practical efficiency. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pages 75–86, 2014.
  29. Influence maximization in near-linear time: A martingale approach. In Proceedings of the 2015 ACM SIGMOD international conference on management of data, pages 1539–1554, 2015.
  30. Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In Proceedings of the 2016 international conference on management of data, pages 695–710, 2016.
  31. Online processing algorithms for influence maximization. In Proceedings of the 2018 International Conference on Management of Data, pages 991–1005, 2018.
  32. Influence maximization revisited: efficient sampling with bound tightened. ACM Transactions on Database Systems, 47(3):12:1–12:45, 2022.
  33. Pointer networks. Advances in neural information processing systems, 28, 2015.
  34. Neural machine translation by jointly learning to align and translate. In 3rd International Conference on Learning Representations, 2015.
  35. Neural combinatorial optimization with reinforcement learning. In 5rd International Conference on Learning Representations, 2017.
  36. Reinforcement learning for solving the vehicle routing problem. Advances in neural information processing systems, 31, 2018.
  37. Learning heuristics for the tsp by policy gradient. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018, Proceedings 15, pages 170–181. Springer, 2018.
  38. Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning. arXiv preprint arXiv:1911.04936, 2019.
  39. Deep learning on graphs: A survey. IEEE Transactions on Knowledge and Data Engineering, 34(1):249–270, 2020.
  40. Learning combinatorial optimization algorithms over graphs. Advances in neural information processing systems, 30, 2017.
  41. Combinatorial optimization with graph convolutional networks and guided tree search. Advances in neural information processing systems, 31, 2018b.
  42. Gcomb: Learning budget-constrained combinatorial algorithms over billion-sized graphs. Advances in Neural Information Processing Systems, 33:20000–20011, 2020.
  43. Deep reinforcement learning meets graph neural networks: Exploring a routing optimization use case. Computer Communications, 196:184–194, 2022.
  44. Learning scheduling algorithms for data processing clusters. In Proceedings of the ACM special interest group on data communication, pages 270–288. 2019.
  45. Combining deep reinforcement learning with graph neural networks for optimal vnf placement. IEEE Communications Letters, 25(1):176–180, 2020.
  46. Finding key players in complex networks through deep reinforcement learning. Nature machine intelligence, 2(6):317–324, 2020.
  47. Piano: Influence maximization meets deep reinforcement learning. IEEE Transactions on Computational Social Systems, 10(3):1288–1300, 2022.
  48. Influence maximization in complex networks by using evolutionary deep reinforcement learning. IEEE Transactions on Emerging Topics in Computational Intelligence, 7(4):995–1009, 2022.
  49. Touplegdd: A fine-designed solution of influence maximization by deep reinforcement learning. IEEE Transactions on Computational Social Systems, 2023.
  50. Deep graph representation learning and optimization for influence maximization. In International Conference on Machine Learning, pages 21350–21361. PMLR, 2023.
  51. Bandit problems: sequential allocation of experiments (monographs on statistics and applied probability). London: Chapman and Hall, 5(71-87):7–7, 1985.
  52. Reinforcement learning: An introduction. MIT press, 2018.
  53. Bandit algorithms. Cambridge University Press, 2020.
  54. Minimax policies for combinatorial prediction games. In Proceedings of the 24th Annual Conference on Learning Theory, pages 107–132. JMLR Workshop and Conference Proceedings, 2011.
  55. Combinatorial multi-armed bandit: General framework and applications. In International conference on machine learning, pages 151–159. PMLR, 2013.
  56. Combinatorial multi-armed bandit and its extension to probabilistically triggered arms. The Journal of Machine Learning Research, 17(1):1746–1778, 2016.
  57. Finite-time analysis of the multiarmed bandit problem. Machine learning, 47:235–256, 2002.
  58. Improving regret bounds for combinatorial semi-bandits with probabilistically triggered arms and its applications. Advances in Neural Information Processing Systems, 30, 2017.
  59. Online influence maximization under independent cascade model with semi-bandit feedback. Advances in neural information processing systems, 30, 2017.
  60. Model-independent online learning for influence maximization. In International Conference on Machine Learning, pages 3530–3539. PMLR, 2017.
  61. Factorization bandits for online influence maximization. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 636–646, 2019.
  62. Influence maximization with bandits. arXiv preprint arXiv:1503.00024, 2015.
  63. Online influence maximization under linear threshold model. Advances in Neural Information Processing Systems, 33:1192–1204, 2020.
  64. Online influence maximization with node-level feedback using standard offline oracles. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, pages 9153–9161, 2022.
  65. Online learning and optimization under a new linear-threshold model with negative influence. arXiv preprint arXiv:1911.03276, 2019.
  66. Online learning of independent cascade models with node-level feedback. arXiv preprint arXiv:2109.02519, 2021.
  67. Online influence maximization in non-stationary social networks. In 2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS), pages 1–6. IEEE, 2016.
  68. Revealing graph bandits for maximizing local influence. In Artificial Intelligence and Statistics, pages 10–18. PMLR, 2016.
  69. Online influence maximization with local observations. In Algorithmic Learning Theory, pages 557–580. PMLR, 2019.
  70. Decentralized online influence maximization. In 2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pages 1–8. IEEE, 2022.
  71. Stochastic top k-subset bandits with linear space and non-linear feedback with applications to social influence maximization. ACM/IMS Transactions on Data Science, 2(4):38:1–38:39, 2022.
  72. A data-based approach to social influence maximization. Proceedings of the VLDB Endowment, 5(1), 2011c.
  73. Dart: Adaptive accept reject algorithm for non-linear combinatorial bandits. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, pages 6557–6565, 2021.
  74. Multi-round influence maximization. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pages 2249–2258, 2018.
  75. Algorithms for online influencer marketing. ACM Transactions on Knowledge Discovery from Data, 13(1):3:1–3:30, 2018.
  76. Contextual bandits for advertising campaigns: A diffusion-model independent approach. In Proceedings of the 2022 SIAM International Conference on Data Mining (SDM), pages 513–521. SIAM, 2022.
  77. Thompson sampling for combinatorial semi-bandits. In International Conference on Machine Learning, pages 5114–5122. PMLR, 2018.
  78. Analysis of thompson sampling for combinatorial multi-armed bandit with probabilistically triggered arms. In The 22nd International Conference on Artificial Intelligence and Statistics, pages 1322–1330. PMLR, 2019.
  79. Thompson sampling for combinatorial network optimization in unknown environments. IEEE/ACM Transactions on Networking, 28(6):2836–2849, 2020.
  80. Gaussian process bandits for online influence maximization. In 2020 International Conference on Data Mining Workshops (ICDMW), pages 106–113. IEEE, 2020.
  81. Combinatorial gaussian process bandits with probabilistically triggered arms. In International Conference on Artificial Intelligence and Statistics, pages 3844–3852. PMLR, 2021.
  82. Gaussian process optimization in the bandit setting: No regret and experimental design. In International Conference on Machine Learning, pages 1015–1022. PMLR, 2010.
  83. Online topic-aware influence maximization. Proceedings of the VLDB Endowment, 8(6):666–677, 2015.
  84. Online contextual influence maximization in social networks. In 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pages 1204–1211. IEEE, 2016.
  85. Online contextual influence maximization with costly observations. IEEE Transactions on Signal and Information Processing over Networks, 5(2):273–289, 2018.
  86. On budgeted influence maximization in social networks. IEEE Journal on Selected Areas in Communications, 31(6):1084–1094, 2013.
  87. Efficient algorithms for budgeted influence maximization on massive social networks. Proceedings of the VLDB Endowment, 13(9):1498–1510, 2020.
  88. Online learning with cumulative oversampling: Application to budgeted influence maximization. arXiv preprint arXiv:2004.11963, 2020.
  89. A tutorial on thompson sampling. Foundations and Trends® in Machine Learning, 11(1):1–96, 2018.
  90. Budgeted online influence maximization. In International Conference on Machine Learning, pages 7620–7631. PMLR, 2020.
  91. Online competitive influence maximization. In International Conference on Artificial Intelligence and Statistics, pages 11472–11502. PMLR, 2022.
  92. Competitive influence maximization in social networks. In Internet and Network Economics: Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007. Proceedings 3, pages 306–311. Springer, 2007.
  93. A multi-feature diffusion model: Rumor blocking in social networks. IEEE/ACM Transactions on Networking, 29(1):386–397, 2020.
  94. Contextual combinatorial cascading bandits. In International conference on machine learning, pages 1245–1253. PMLR, 2016.
  95. Contextual combinatorial bandits with probabilistically triggered arms. In International Conference on Machine Learning, pages 22559–22593. PMLR, 2023.
  96. Batch-size independent regret bounds for combinatorial semi-bandits with probabilistically triggered arms or independent arms. Advances in Neural Information Processing Systems, 35:14904–14916, 2022.
  97. Influential nodes in a diffusion model for social networks. In Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings 32, pages 1127–1138. Springer, 2005.
  98. Influence maximization for cascade model with diffusion decay in social networks. In Social Computing: Second International Conference of Young Computer Scientists, Engineers and Educators, ICYCSEE 2016, Harbin, China, August 20-22, 2016, Proceedings, Part I 2, pages 418–427. Springer, 2016.
  99. Online influence maximization under decreasing cascade model. In Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, page 2197–2204, 2023.
  100. A novel scene of viral marketing for complementary products. IEEE Transactions on Computational Social Systems, 6(4):797–808, 2019.
  101. Dscom: A data-driven self-adaptive community-based framework for influence maximization in social networks. arXiv preprint arXiv:2311.11080, 2023.
  102. A modified exp3 in adversarial bandits with multi-user delayed feedback. In International Computing and Combinatorics Conference, pages 1–15. Springer, 2023.
  103. Adversarial bandits with multi-user delayed feedback: Theory and application. arXiv preprint arXiv:2310.11188, 2023b.
  104. A survey on location-driven influence maximization. arXiv preprint arXiv:2204.08005, 2022.
  105. Influence maximization: Seeding based on community structure. ACM Transactions on Knowledge Discovery from Data, 14(6):66:1–66:22, 2020.
  106. Signed-pagerank: An efficient influence maximization framework for signed social networks. IEEE Transactions on Knowledge and Data Engineering, 33(5):2208–2222, 2019.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (1)
  1. Jianxiong Guo (38 papers)

Summary

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

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