强化学习
最大化
计算机科学
人工智能
启发式
机器学习
学习迁移
社交网络(社会语言学)
竞争性学习
网络拓扑
钥匙(锁)
竞赛(生物学)
数学优化
深度学习
数学
计算机网络
万维网
生物
计算机安全
社会化媒体
生态学
作者
Khurshed Ali,Chih-Yu Wang,Mi-Yen Yeh,Yi-Shin Chen
标识
DOI:10.1109/asonam49781.2020.9381471
摘要
Recent studies have considered the reinforcement and deep reinforcement learning models to address the competitive influence maximization (CIM) problem. However, these models assume complete network topology information is available to address the CIM problem. This assumption is unrealistic as it is difficult to obtain complete social network data and requires exhaustive efforts to obtain it. In this work, we propose a deep reinforcement learning-based (DRL) model to tackle the competitive influence maximization on unknown social networks. Our proposed model has a two-fold objective: the first is to identify the time when to explore the network to collect network information. The second is to determine key influential users from the explored network, using optimal seed-selection strategy considering the competition in the social network. Moreover, we integrate the transfer learning in DRL to improve the training efficiency of DRL models. Experimental results show that our proposed DRL and transfer learning-based DRL models achieve significantly better performance than heuristic-based methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI