Graph Bayesian Optimization for Multiplex Influence Maximization (2403.18866v1)
Abstract: Influence maximization (IM) is the problem of identifying a limited number of initial influential users within a social network to maximize the number of influenced users. However, previous research has mostly focused on individual information propagation, neglecting the simultaneous and interactive dissemination of multiple information items. In reality, when users encounter a piece of information, such as a smartphone product, they often associate it with related products in their minds, such as earphones or computers from the same brand. Additionally, information platforms frequently recommend related content to users, amplifying this cascading effect and leading to multiplex influence diffusion. This paper first formulates the Multiplex Influence Maximization (Multi-IM) problem using multiplex diffusion models with an information association mechanism. In this problem, the seed set is a combination of influential users and information. To effectively manage the combinatorial complexity, we propose Graph Bayesian Optimization for Multi-IM (GBIM). The multiplex diffusion process is thoroughly investigated using a highly effective global kernelized attention message-passing module. This module, in conjunction with Bayesian linear regression (BLR), produces a scalable surrogate model. A data acquisition module incorporating the exploration-exploitation trade-off is developed to optimize the seed set further. Extensive experiments on synthetic and real-world datasets have proven our proposed framework effective. The code is available at https://github.com/zirui-yuan/GBIM.
- 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, 306–311. Springer.
- Maximizing social influence in nearly optimal time. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, 946–957. SIAM.
- A Bayesian interactive optimization approach to procedural animation design. In Proceedings of the 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, 103–112.
- Rethinking Attention with Performers. In International Conference on Learning Representations.
- An influence model based on heterogeneous online social network for influence maximization. IEEE Transactions on Network Science and Engineering, 7(2): 737–749.
- On the evolution of random graphs. Publ. math. inst. hung. acad. sci, 5(1): 17–60.
- A Greedy Algorithm for Budgeted Multiple-Product Profit Maximization in Social Network. In 2022 23rd IEEE International Conference on Mobile Data Management (MDM), 440–445. IEEE.
- 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.
- CIM: clique-based heuristic for finding influential nodes in multilayer networks. Applied Intelligence, 52(5): 5173–5184.
- Influence maximization across heterogeneous interconnected networks based on deep learning. Expert Systems with Applications, 140: 112905.
- 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.
- Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980.
- Multiplex influence maximization in online social networks with heterogeneous diffusion models. IEEE Transactions on Computational Social Systems, 5(2): 418–429.
- Influence maximization on social graphs: A survey. IEEE Transactions on Knowledge and Data Engineering, 30(10): 1852–1872.
- A Survey on Influence Maximization: From an ML-Based Combinatorial Optimization. arXiv preprint arXiv:2211.03074.
- Mahe-im: multiple aggregation of heterogeneous relation embedding for influence maximization on heterogeneous information network. Expert Systems with Applications, 202: 117289.
- Deep Graph Representation Learning and Optimization for Influence Maximization. In International Conference on Machine Learning, 21350–21361. PMLR.
- From competition to complementarity: comparative influence diffusion and maximization. arXiv preprint arXiv:1507.00317.
- Deep neural architecture search with deep graph bayesian optimization. In IEEE/WIC/ACM International Conference on Web Intelligence, 500–507.
- Mockus, J. 1998. The application of Bayesian methods for seeking the extremum. Towards global optimization, 2: 117.
- Information coverage maximization for multiple products in social networks. Theoretical Computer Science, 828: 32–41.
- Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems, 32.
- Scalable hyperparameter transfer learning. Advances in neural information processing systems, 31.
- Practical bayesian optimization of machine learning algorithms. Advances in neural information processing systems, 25.
- Scalable bayesian optimization using deep neural networks. In International conference on machine learning, 2171–2180. PMLR.
- Bayesian optimization with robust Bayesian neural networks. Advances in neural information processing systems, 29.
- Influence maximization in near-linear time: A martingale approach. In Proceedings of the 2015 ACM SIGMOD international conference on management of data, 1539–1554.
- Parallel greedy algorithm to multiple influence maximization in social network. ACM Transactions on Knowledge Discovery from Data (TKDD), 15(3): 1–21.
- Influence maximization across partially aligned heterogenous social networks. In Pacific-Asia conference on knowledge discovery and data mining, 58–69. Springer.
- Blocking Influence at Collective Level with Hard Constraints (Student Abstract). In Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, 13115–13116.