Jairo Enrique Ramírez Sánchez
Christian Blum
ABSTRACT
The use of machine learning techniques within metaheuristics is a rapidly growing field of research. In this paper, we show how a deep learning framework can be beneficially used to improve an ant colony optimization algorithm. In particular, problem information obtained via deep learning is combined in our algorithm by means of Q-learning with the usual pheromone and greedy information. Our algorithm is applied to the Target Set Selection (TSS) problem, which is an NP-hard combinatorial optimization problem with applications, for example, in social networks. The specific problem variant considered in this paper asks for finding a smallest subset of the nodes of a given graph such that their influence can be spread to all other nodes of the graph via a diffusion process. The experimental results show, first, that the pure ant colony optimization approach can already compete with the state of the art. Second, the obtained results indicate that the hybrid algorithm variant outperforms the pure ant colony optimization approach especially in the context of large problem instances.
- Eyal Ackerman, Oren Ben-Zwi, and Guy Wolfovitz. 2010. Combinatorial model and bounds for target set selection. Theoretical Computer Science 411, 44--46 (2010), 4017--4022.Google Scholar
Cross Ref
- Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, and Ilan Newman. 2011. Treewidth governs the complexity of target set selection. Discrete Optimization 8, 1 (2011), 87--96.Google ScholarDigital Library
- Yoshua Bengio, Andrea Lodi, and Antoine Prouvost. 2021. Machine learning for combinatorial optimization: A methodological tour d'horizon. Eur. J. Oper. Res. 290, 2 (2021), 405--421.Google ScholarCross Ref
- Chen Cai and Yusu Wang. 2020. A Note on Over-Smoothing for Graph Neural Networks. (2020). arXiv:2006.13318 http://arxiv.org/abs/2006.13318Google Scholar
- Moses Charikar, Yonatan Naamad, and Anthony Wirth. 2016. On Approximating Target Set Selection. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 60), Klaus Jansen, Claire Mathieu, José D. P. Rolim, and Chris Umans (Eds.). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 4:1--4:16. Google ScholarCross Ref
- Deli Chen, Yankai Lin, Wei Li, Peng Li, Jie Zhou, and Xu Sun. 2020. Measuring and relieving the over-smoothing problem for graph neural networks from the topological view. In AAAI 2020 - 34th AAAI Conference on Artificial Intelligence. 3438--3445. arXiv:1909.03211 Google ScholarCross Ref
- Ning Chen. 2009. On the approximability of influence in social networks. SIAM Journal on Discrete Mathematics 23, 3 (2009), 1400--1415.Google ScholarDigital Library
- Wei Chen, Chi Wang, and Yajun Wang. 2010. 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.Google ScholarDigital Library
- Wei Chen, Yajun Wang, and Siyu Yang. 2009. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. 199--208.Google ScholarDigital Library
- Morgan Chopin, André Nichterlein, Rolf Niedermeier, and Mathias Weller. 2014. Constant thresholds can make target set selection tractable. Theory of Computing Systems 55, 1 (2014), 61--83.Google ScholarDigital Library
- Gennaro Cordasco, Luisa Gargano, Marco Mecchia, Adele A Rescigno, and Ugo Vaccaro. 2015. A fast and effective heuristic for discovering small target sets in social networks. In Combinatorial Optimization and Applications. Springer, 193--208.Google Scholar
- Gennaro Cordasco, Luisa Gargano, and Adele Anna Rescigno. 2015. Influence Propagation over Large Scale Social Networks. In Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015 (Paris, France) (ASONAM '15). Association for Computing Machinery, New York, NY, USA, 1531--1538. Google ScholarDigital Library
- Gennaro Cordasco, Luisa Gargano, and Adele A Rescigno. 2016. On finding small sets that influence large networks. Social Network Analysis and Mining 6, 1 (2016), 1--20.Google ScholarCross Ref
- Omid E. David and Iddo Greental. 2014. Genetic Algorithms for Evolving Deep Neural Networks. In Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation (Vancouver, BC, Canada) (GECCO Comp '14). Association for Computing Machinery, New York, NY, USA, 1451--1452. Google ScholarDigital Library
- Shifei Ding, Chunyang Su, and Junzhao Yu. 2011. An optimizing BP neural network algorithm based on genetic algorithm. Artificial Intelligence Review 36, 2 (Feb 2011), 153--162. Google ScholarDigital Library
- Marco Dorigo and Thomas Stützle. 2004. Ant Colony Optimization. The MIT Press.Google Scholar
- Author Dummy. 2021. Adding Negative Learning to Ant Colony Optimization: A Comprehensive Study. Mathematics 9, 4 (2021).Google Scholar
- Author Dummy. 2022. A Biased Random Key Genetic Algorithm Applied to Target Set Selection in Viral Marketing. In Proceedings of the Genetic and Evolutionary Computation Conference (Boston, Massachusetts) (GECCO '22). Association for Computing Machinery, New York, NY, USA, 241--250.Google Scholar
- Author Dummy. 2022. Boosting a Genetic Algorithm with Graph Neural Networks for Multi-Hop Influence Maximization in Social Networks. In Proceedigns of FedCSIS 2022 - 17th Conference on Computer Science and Intelligence Systems. IEEE, 363--371.Google Scholar
- Stefan Ehard and Dieter Rautenbach. 2019. On some tractable and hard instances for partial incentives and target set selection. Discrete Optimization 34 (2019), 100547. Google ScholarDigital Library
- Matthias Fey and Jan E. Lenssen. 2019. Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds.Google Scholar
- Paola Flocchini, Rastislav Královič, Peter Ružička, Alessandro Roncato, and Nicola Santoro. 2003. On time versus size for monotone dynamic monopolies in regular topologies. Journal of Discrete Algorithms 1, 2 (2003), 129--150.Google ScholarDigital Library
- Angela K Fournier, Erin Hall, Patricia Ricke, and Brittany Storey. 2013. Alcohol and the social network: Online social networking sites and college students' perceived drinking norms. Psychology of Popular Media Culture 2, 2 (2013), 86.Google ScholarCross Ref
- Jacob Goldenberg, Barak Libai, and Eitan Muller. 2001. Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata. Academy of Marketing Science Review 9, 3 (2001), 1--18.Google Scholar
- Mark Granovetter. 1978. Threshold models of collective behavior. American journal of sociology 83, 6 (1978), 1420--1443.Google Scholar
- Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. 2008. Exploring Network Structure, Dynamics, and Function using NetworkX. In Proceedings of the 7th Python in Science Conference, Gaël Varoquaux, Travis Vaught, and Jarrod Millman (Eds.). Pasadena, CA USA, 11 -- 15.Google Scholar
- Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive Representation Learning on Large Graphs. In Advances in Neural Information Processing Systems, I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.), Vol. 30. Curran Associates, Inc.Google Scholar
- Tim A Hartmann. 2018. Target set selection parameterized by clique-width and maximum threshold. In International Conference on Current Trends in Theory and Practice of Informatics. Springer, 137--149.Google ScholarCross Ref
- E. Muller J.Goldenberg, B.Libai. 2001. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters 12, 3 (2001), 211--223.Google ScholarCross Ref
- David Kempe, Jon Kleinberg, and Éva Tardos. 2003. Maximizing the Spread of Influence through a Social Network. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (Washington, D.C.) (KDD '03). Association for Computing Machinery, New York, NY, USA, 137--146. Google ScholarDigital Library
- Elias Khalil, Hanjun Dai, Yuyu Zhang, Bistra Dilkina, and Le Song. 2017. Learning Combinatorial Optimization Algorithms over Graphs. In Advances in Neural Information Processing Systems, I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.), Vol. 30. Curran Associates, Inc. https://proceedings.neurips.cc/paper/2017/file/d9896106ca98d3d05b8cbdf4fd8b13a1-Paper.pdfGoogle Scholar
- Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data.Google Scholar
- Cheng Long and Raymond Chi-Wing Wong. 2011. Minimizing Seed Set for Viral Marketing. In 2011 IEEE 11th International Conference on Data Mining. 427--436. Google ScholarDigital Library
- Manuel López-Ibáñez, Jeremie Dubois-Lacoste, Leslie Pérez Cáceres, Mauro Birattari, and Thomas Stützle. 2016. The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives 3 (2016), 43--58.Google ScholarCross Ref
- Vijay Mahajan, Eitan Muller, and Frank M Bass. 1990. New product diffusion models in marketing: A review and directions for research. Journal of marketing 54, 1 (1990), 1--26.Google ScholarCross Ref
- André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, and Mathias Weller. 2013. On tractable cases of target set selection. Social Network Analysis and Mining 3, 2 (2013), 233--256.Google ScholarCross Ref
- Rodrigo Olivares, Francisco Muñoz, and Fabián Riquelme. 2021. A multi-objective linear threshold influence spread model solved by swarm intelligence-based methods. Knowledge-Based Systems 212 (2021), 106623.Google ScholarCross Ref
- Santiago V. Ravelo, Cláudio N. Meneses, and Eduardo A.J. Anacleto. 2020. NP-hardness and evolutionary algorithm over new formulation for a Target Set Selection problem. In 2020 IEEE Congress on Evolutionary Computation (CEC). 1--8. Google ScholarDigital Library
- TV Thirumala Reddy, D Sai Krishna, and C Pandu Rangan. 2010. Variants of spreading messages. In International Workshop on Algorithms and Computation. Springer, 240--251.Google Scholar
- Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and Gabriele Monfardini. 2008. The graph neural network model. IEEE transactions on neural networks 20, 1 (2008), 61--80.Google ScholarDigital Library
- Thomas C Schelling. 2006. Micromotives and macrobehavior. WW Norton & Company.Google Scholar
- Paulo Shakarian, Abhivav Bhatnagar, Ashkan Aleali, Elham Shaabani, and Ruocheng Guo. 2015. Diffusion in social networks. Springer.Google Scholar
- Paulo Shakarian, Sean Eyre, and Damon Paulo. 2013. A scalable heuristic for viral marketing under the tipping model. Social Network Analysis and Mining 3, 4 (2013), 1225--1248.Google ScholarCross Ref
- Yuan Sun, Sheng Wang, Yunzhuang Shen, Xiaodong Li, Andreas T. Ernst, and Michael Kirley. 2022. Boosting ant colony optimization via solution prediction and machine learning. Computers & Operations Research 143 (2022), 105769.Google ScholarDigital Library
- Cheng Wang, Lili Deng, Gengui Zhou, and Meixian Jiang. 2014. A global optimization algorithm for target set selection problems. Information Sciences 267 (2014), 101--118. Google ScholarDigital Library
- Christopher JCH Watkins and Peter Dayan. 1992. Q-learning. Machine learning 8 (1992), 279--292.Google Scholar
- Cong Zhang, Wen Song, Zhiguang Cao, Jie Zhang, Puay Siew Tan, and Xu Chi. 2020. Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning. In Advances in Neural Information Processing Systems, H. Larochelle, M. Ranzato, R. Hadsell, M.F. Balcan, and H. Lin (Eds.), Vol. 33. Curran Associates, Inc., 1621--1632. https://proceedings.neurips.cc/paper/2020/file/11958dfee29b6709f48a9ba0387a2431-Paper.pdfGoogle Scholar
- Jie Zhou, Ganqu Cui, Shengding Hu, Zhengyan Zhang, Cheng Yang, Zhiyuan Liu, Lifeng Wang, Changcheng Li, and Maosong Sun. 2020. Graph neural networks: A review of methods and applications., 57--81 pages. arXiv:1812.08434 Google ScholarCross Ref
Index Terms
- Q-Learning Ant Colony Optimization supported by Deep Learning for Target Set Selection
Recommendations
Learning-Based Neural Ant Colony Optimization
GECCO '23: Proceedings of the Genetic and Evolutionary Computation ConferenceIn this paper, we propose a new ant colony optimization algorithm, called learning-based neural ant colony optimization (LN-ACO), which incorporates an "intelligent ant". This intelligent ant contains a convolutional neural network pre-trained on a ...
Particle swarm optimizer, ant colony strategy and harmony search scheme hybridized for optimization of truss structures
A heuristic particle swarm ant colony optimization (HPSACO) is presented for optimum design of trusses. The algorithm is based on the particle swarm optimizer with passive congregation (PSOPC), ant colony optimization and harmony search scheme. HPSACO ...
Hybridization strategies for continuous ant colony optimization and particle swarm optimization applied to data clustering
Ant colony optimization (ACO) and particle swarm optimization (PSO) are two popular algorithms in swarm intelligence. Recently, a continuous ACO named ACOR was developed to solve the continuous optimization problems. This study incorporated ACOR with ...
Comments