Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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

Many-Objective Evolutionary Influence Maximization: Balancing Spread, Budget, Fairness, and Time (2403.18755v2)

Published 27 Mar 2024 in cs.NE, cs.AI, and cs.SI

Abstract: The Influence Maximization (IM) problem seeks to discover the set of nodes in a graph that can spread the information propagation at most. This problem is known to be NP-hard, and it is usually studied by maximizing the influence (spread) and, optionally, optimizing a second objective, such as minimizing the seed set size or maximizing the influence fairness. However, in many practical scenarios multiple aspects of the IM problem must be optimized at the same time. In this work, we propose a first case study where several IM-specific objective functions, namely budget, fairness, communities, and time, are optimized on top of the maximization of influence and minimization of the seed set size. To this aim, we introduce MOEIM (Many-Objective Evolutionary Algorithm for Influence Maximization) a Multi-Objective Evolutionary Algorithm (MOEA) based on NSGA-II incorporating graph-aware operators and a smart initialization. We compare MOEIM in two experimental settings, including a total of nine graph datasets, two heuristic methods, a related MOEA, and a state-of-the-art Deep Learning approach. The experiments show that MOEIM overall outperforms the competitors in most of the tested many-objective settings. To conclude, we also investigate the correlation between the objectives, leading to novel insights into the topic. The codebase is available at https://github.com/eliacunegatti/MOEIM.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (58)
  1. On the fairness of time-critical influence maximization in social networks. IEEE Transactions on Knowledge and Data Engineering 35, 3 (2023), 2875–2886.
  2. Fairness in influence maximization through randomization. Journal of Artificial Intelligence Research 73 (2022), 1251–1283.
  3. Benedek Rozemberczki and Rik Sarkar. 2020. Characteristic Functions on Graphs: Birds of a Feather, from Statistical Descriptors to Parametric Models. In International Conference on Information and Knowledge Management. ACM, New York, NY, USA, 1325–1334.
  4. Efficient algorithms for budgeted influence maximization on massive social networks. Proceedings of the VLDB Endowment 13, 9 (2020), 1498–1510.
  5. An improved clustering based multi-objective evolutionary algorithm for influence maximization under variable-length solutions. Knowledge-Based Systems 256 (2022), 109856.
  6. Multi-Objective Influence Maximization Under Varying-Size Solutions and Constraints. In IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. IEEE, New York, NY, USA, 285–292.
  7. Doina Bucur and Giovanni Iacca. 2016. Influence maximization in social networks with genetic algorithms. In Applications of Evolutionary Computation. Springer, Cham, Switzerland, 379–392.
  8. Multi-objective evolutionary algorithms for influence maximization in social networks. In Applications of Evolutionary Computation. Springer, Cham, Switzerland, 221–233.
  9. Improving multi-objective evolutionary influence maximization in social networks. In Applications of Evolutionary Computation. Springer, Cham, Switzerland, 117–124.
  10. Neighbor-Hop Mutation for Genetic Algorithm in Influence Maximization. In Conference on Genetic and Evolutionary Computation Companion. ACM, New York, NY, USA, 187–190.
  11. ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning. IEEE Transactions on Computational Social Systems (early access) (2023), 1–12.
  12. Time-critical influence maximization in social networks with time-delayed diffusion process. In AAAI Conference on Artificial Intelligence, Vol. 26. Association for the Advancement of Artificial Intelligence, Washington DC, USA, 591–598.
  13. Efficient influence maximization in social networks. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, NY, USA, 199–208.
  14. Large-scale multi-objective influence maximisation with network downscaling. In International Conference on Parallel Problem Solving from Nature. Springer, Cham, Switzerland, 207–220.
  15. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6, 2 (2002), 182–197.
  16. A unifying framework for fairness-aware influence maximization. In The Web Conference Companion. ACM, New York, NY, USA, 714–722.
  17. Influence Maximization with Fairness at Scale. arXiv preprint arXiv:2306.01587.
  18. Giovanni Iacca and Kateryna Konotopska and Doina Bucur and Alberto Tonda. 2021. An evolutionary framework for maximizing influence propagation in social networks. Software Impacts 9 (2021), 100107.
  19. Community structure in jazz. Advances in complex systems 6, 04 (2003), 565–573.
  20. Hao Gong and Chunxiang Guo. 2023. Influence maximization considering fairness: A multi-objective optimization approach with prior knowledge. Expert Systems with Applications 214 (2023), 119138.
  21. Influence maximization in social networks based on discrete particle swarm optimization. Information Sciences 367 (2016), 600–614.
  22. CELF++ optimizing the greedy algorithm for influence maximization in social networks. In International Conference on World Wide Web Companion. ACM, New York, NY, USA, 47–48.
  23. Holm, Sture. 1979. A simple sequentially rejective multiple test procedure. Scandinavian journal of statistics 6, 2 (1979), 65–70.
  24. Simulated annealing based influence maximization in social networks. In AAAI Conference on Artificial intelligence, Vol. 25. Association for the Advancement of Artificial Intelligence, Washington DC, USA, 127–132.
  25. Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data.
  26. Maximizing the spread of influence through a social network. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, NY, USA, 137–146.
  27. Adversarial graph embeddings for fair influence maximization over social networks. arXiv preprint arXiv:2005.04074.
  28. Graph-aware evolutionary algorithms for influence maximization. In Genetic and Evolutionary Computation Conference Companion. ACM, New York, NY, USA, 1467–1475.
  29. A fast approximation for influence maximization in large social networks. In International Conference on World Wide Web. ACM, New York, NY, USA, 1157–1162.
  30. Cost-effective outbreak detection in networks. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, NY, USA, 420–429.
  31. Signed networks in social media. In SIGCHI Conference on Human Factors in Computing Systems. ACM, New York, NY, USA, 1361–1370.
  32. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data 1, 1 (2007), 2–es.
  33. Learning to discover social circles in ego networks. Advances in Neural Information Processing Systems 25 (2012), 9 pages.
  34. PIANO: Influence maximization meets deep reinforcement learning. IEEE Transactions on Computational Social Systems 10, 3 (2023), 1288–1300.
  35. Deep graph representation learning and optimization for influence maximization. In International Conference on Machine Learning. PMLR, Honolulu, HI, USA, 21350–21361.
  36. Time constrained influence maximization in social networks. In IEEE International Conference on Data Mining. IEEE, New York, NY, USA, 439–448.
  37. An improved influence maximization method for social networks based on genetic algorithm. Physica A: Statistical Mechanics and its Applications 586 (2022), 126480.
  38. Influence maximization in complex networks by using evolutionary deep reinforcement learning. IEEE Transactions on Emerging Topics in Computational Intelligence 7 (2022), 995–1009. Issue 4.
  39. Automating the construction of internet portals with machine learning. Information Retrieval 3 (2000), 127–163.
  40. A multi-objective linear threshold influence spread model solved by swarm intelligence-based methods. Knowledge-Based Systems 212 (2021), 106623.
  41. Multi-task learning for influence estimation and maximization. IEEE Transactions on Knowledge and Data Engineering 34, 9 (2020), 4398–4409.
  42. Peixoto, Tiago P. 2020. The Netzschleuder network catalogue and repository. https://networks.skewed.de.
  43. Budgeted online influence maximization. In International Conference on Machine Learning. PMLR, virtual event, 7620–7631.
  44. Competitive influence maximization within time and budget constraints in online social networks: An algorithmic approach. Applied Sciences 9, 11 (2019), 2274.
  45. On the Group-Fairness-Aware Influence Maximization in Social Networks. IEEE Transactions on Computational Social Systems 10, 6 (2022), 3406–3414.
  46. A depth-based heuristic to solve the multi-objective influence spread problem using particle swarm optimization. OPSEARCH 60 (2023), 1267–1285.
  47. Ryan Rossi and Nesreen Ahmed. 2015. The network data repository with interactive graph analytics and visualization. In AAAI Conference on Artificial Intelligence, Vol. 29. Association for the Advancement of Artificial Intelligence, Washington DC, USA, 4292–4293.
  48. Scalable Fair Influence Maximization. Advances in Neural Information Processing Systems 1 (2023), 12 pages.
  49. A survey on the hypervolume indicator in evolutionary multiobjective optimization. IEEE Transactions on Evolutionary Computation 25, 1 (2020), 1–20.
  50. Seeding network influence in biased networks and the benefits of diversity. In The Web Conference. ACM, New York, NY, USA, 2089–2098.
  51. Online processing algorithms for influence maximization. In ACM SIGMOD International Conference on Management of Data. ACM, New York, NY, USA, 991–1005.
  52. Influence maximization in near-linear time: A martingale approach. In ACM SIGMOD International Conference on Management of Data. ACM, New York, NY, USA, 1539–1554.
  53. Time-constrained adaptive influence maximization. IEEE Transactions on Computational Social Systems 8, 1 (2020), 33–44.
  54. From Louvain to Leiden: guaranteeing well-connected communities. Scientific reports 9, 1 (2019), 5233.
  55. Group-fairness in influence maximization. arXiv preprint arXiv:1903.00967.
  56. Tukey, John W. 1949. Comparing individual means in the analysis of variance. Biometrics 5, 2 (1949), 99–114.
  57. Maximizing the spread of influence via generalized degree discount. PloS ONE 11, 10 (2016), e0164393.
  58. Collective dynamics of ‘small-world’networks. Nature 393, 6684 (1998), 440–442.
Citations (2)
View on Semantic Scholar

Summary

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

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