Competitive Influence Maximization in Trust-Based Social Networks With Deep Q-Learning
DOI:
https://doi.org/10.24193/subbi.2024.1.04Keywords:
influence maximization, reinforcement learning, Q-learningAbstract
Social network analysis is a rapidly evolving research area having several real-life application areas, e.g. digital marketing, epidemiology, spread of misinformation. Influence maximization aims to select a subset of nodes in such manner that the information propagated over the network is maximized. Competitive influence maximization, which describes the phenomena of multiple actors competing for resources within the same infrastructure, can be solved with a greedy approach selecting the seed nodes utilizing the influence strength between nodes. Recently, deep reinforcement learning methods were applied for estimating the influence strength. We train a controller with reinforcement learning for selecting a node list of given length as the initial seed set for the information spread. Our experiments show that deep Q-learning methods are suitable to analyze the competitive influence maximization on trust and distrust based social networks.
Received by the editors: 1 March 2023.
2010 Mathematics Subject Classification. 68T05.
1998 CR Categories and Descriptors. G.2.2 Discrete Mathematics: Graph Theory – Network problems; G.3. Probability and Statistics: Markov Processes; I.2.6 Artificial Intelligence: Learning – Connectionism and neural nets.
References
Carnes, T., Nagarajan, C., Wild, S. M., and van Zuylen, A. (2007). Maximizing influence in a competitive social network: A follower’s perspective. In Proceedings of the Ninth International Conference on Electronic Commerce, ICEC ’07, page 351–360, New York, NY, USA. Association for Computing Machinery.
Chen, M., Zheng, Q., Boginski, V., and Pasiliao, E. (2021). Influence maximization in social media networks concerning dynamic user behaviors via reinforcement learning. Computational Social Networks, 8.
Kempe, D., Kleinberg, J., and Tardos, É. (2003). Maximizing the spread of influence through a social network. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 137- 146.
Leskovec, J., Huttenlocher, D. P., and Kleinberg, J. M. (2010). Signed networks in social media. Proceedings of the SIGCHI Conference on Human Factors in Computing Systems.
Li, D., Xu, Z., Chakraborty, N., Gupta, A., Sycara, K. P., and Li, S. (2014). Polarity related influence maximization in signed social networks. PLoS ONE, 9.
Li, H., Xu, M., Bhowmick, S. S., Rayhan, J. S., Sun, C., and Cui, J. (2022). Piano: Influence maximization meets deep reinforcement learning. IEEE Transactions on Computational Social Systems, pages 1–13.
Lin, M., Li, W., and Lu, S. (2020). Balanced Influence Maximization in Attributed Social Network Based on Sampling, page 375–383. Association for Computing Machinery, New York, NY, USA.
McCallum, A. K., Nigam, K., Rennie, J., and Seymore, K. (2000). Automating the construction of internet portals with machine learning. Information Retrieval, 3(2):127–163.
Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., and Riedmiller, M. (2013). Playing atari with deep reinforcement learning. arXiv preprint arXiv:1312.5602.
Sutton, R. S. and Barto, A. G. (2018). Reinforcement Learning: An Introduction. The MIT Press, second edition.
Xie, L., Huang, H., and Du, Q. (2022). A hierarchical generative embedding model for influence maximization in attributed social networks. Applied Sciences, 12(3):1321.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Studia Universitatis Babeș-Bolyai Informatica
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
