MIM-Reasoner: Learning with Theoretical Guarantees for Multiplex Influence Maximization
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910360921964544 |
|---|---|
| author | Do, Nguyen Chowdhury, Tanmoy Ling, Chen Zhao, Liang Thai, My T. |
| author_facet | Do, Nguyen Chowdhury, Tanmoy Ling, Chen Zhao, Liang Thai, My T. |
| contents | Multiplex influence maximization (MIM) asks us to identify a set of seed users such as to maximize the expected number of influenced users in a multiplex network. MIM has been one of central research topics, especially in nowadays social networking landscape where users participate in multiple online social networks (OSNs) and their influences can propagate among several OSNs simultaneously. Although there exist a couple combinatorial algorithms to MIM, learning-based solutions have been desired due to its generalization ability to heterogeneous networks and their diversified propagation characteristics. In this paper, we introduce MIM-Reasoner, coupling reinforcement learning with probabilistic graphical model, which effectively captures the complex propagation process within and between layers of a given multiplex network, thereby tackling the most challenging problem in MIM. We establish a theoretical guarantee for MIM-Reasoner as well as conduct extensive analyses on both synthetic and real-world datasets to validate our MIM-Reasoner's performance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_16898 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | MIM-Reasoner: Learning with Theoretical Guarantees for Multiplex Influence Maximization Do, Nguyen Chowdhury, Tanmoy Ling, Chen Zhao, Liang Thai, My T. Social and Information Networks Artificial Intelligence Machine Learning Probability Multiplex influence maximization (MIM) asks us to identify a set of seed users such as to maximize the expected number of influenced users in a multiplex network. MIM has been one of central research topics, especially in nowadays social networking landscape where users participate in multiple online social networks (OSNs) and their influences can propagate among several OSNs simultaneously. Although there exist a couple combinatorial algorithms to MIM, learning-based solutions have been desired due to its generalization ability to heterogeneous networks and their diversified propagation characteristics. In this paper, we introduce MIM-Reasoner, coupling reinforcement learning with probabilistic graphical model, which effectively captures the complex propagation process within and between layers of a given multiplex network, thereby tackling the most challenging problem in MIM. We establish a theoretical guarantee for MIM-Reasoner as well as conduct extensive analyses on both synthetic and real-world datasets to validate our MIM-Reasoner's performance. |
| title | MIM-Reasoner: Learning with Theoretical Guarantees for Multiplex Influence Maximization |
| topic | Social and Information Networks Artificial Intelligence Machine Learning Probability |
| url | https://arxiv.org/abs/2402.16898 |