arrow
返回

Evolving Influence Maximization in Evolving Networks

delete2020-10-20
delete5
delete
OA
AI
X
Xudong Wu *
傅
傅洛伊 (Luoyi Fu)
Z
Zixin Zhang
H
Huan Long
J
Jingfan Meng
X
Xinbing Wang
G
Guihai Chen
DOI:10.1145/3409370delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Influence Maximization (IM) aims to maximize the number of people that become aware of a product by finding the best set of seed users to initiate the product advertisement. Unlike most prior arts on the static networks containing fixed number of users, we study the evolving IMin more realistic evolving networks with temporally growing topology. The task of evolving IM, however, is far more challenging over static cases in the sense that the seed selection should consider its impact on future users who will join network during influence diffusion and the probabilities that users influence one another also evolve over time. We address the challenges brought by network evolution through EIM, a newly proposed bandit-based framework that alternates between seed nodes selection and knowledge (i.e., nodes' growing speed and evolving activation probabilities) learning during network evolution. Remarkably, the EIM framework involves three novel components to handle the uncertainties brought by evolution: (1) A fully adaptive particle learning of nodes' growing speed for accurately estimating future influenced size, with real growing behaviors delineated by a set of weighted particles. (2) A bandit-based refining method with growing arms to cope with the evolving activation probabilities via growing edges from previous influence diffusion feedbacks. (3) Evo-IMM, an evolving seed selection algorithm, which leverages the Influence Maximization via Martingale (IMM) framework, with the objective to maximize the influence spread to highly attractive users during evolution. Theoretically, the EIM framework returns a regret bound that provably maintains its sublinearity with respect to the growing network size. Empirically, the effectiveness of the EIM framework is also validated with three notable million-scale evolving network datasets possessing complete social relationships and nodes' joining time. The results confirm the superiority of the EIMframework in terms of an up to 50% larger influenced size over four static baselines.
Keyword:
Evolving social network
evolving influence maximization
multi-arm bandit
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

ACM Transactions on Internet Technology 封面图
ACM Transactions on Internet Technology
IF:
4.1
论文数:
896
被引数:
1.9K

机构

S
shanghai jiao tong university
学者数:
15.7W
论文数: 11.7W
被引数: 159
引用论文

引用论文

Adaptive Influence Maximization in Dynamic Social Networks
err2017-02-01
err172
errOAAI
errTong, Guangmo; Wu, Weili; Tang, Shaojie; Du, Ding-Zhu
err分享
err收藏
A high-resolution human contact network for infectious disease transmission
err2010-12-13
err561
errOAAI
errSalathe, Marcel; Kazandjieva, Maria; Lee, Jung Woo; Levis, Philip; Feldman, Marcus W.; Jones, James H.
err分享
err收藏
Grouping Peers Based on Complementary Degree and Social Relationship using Genetic Algorithm
err2018-10-16
err13
PREAI
errShih, Timothy K.; Gunarathne, W. K. T. M.; Ochirbat, Ankhtuya; Su, Huang-Ming
err分享
err收藏
Reconstructing propagation networks with natural diversity and identifying hidden sources
err2014-07-11
err110
errOAAI
errShen, Zhesi; Wang, Wen-Xu; Fan, Ying; Di, Zengru; Lai, Ying-Cheng
err分享
err收藏
Inferring Networks of Diffusion and Influence
err2012-02-01
err375
errOAAI
errGomez-Rodriguez, Manuel; Leskovec, Jure; Krause, Andreas
err分享
err收藏
GLP: A Novel Framework for Group-Level Location Promotion in Geo-Social Networks
err2018-12-01
err10
PREAI
errWu, Xudong; Fu, Luoyi; Yao, Yuhang; Fu, Xinzhe; Wang, Xinbing; Chen, Guihai
err分享
err收藏
err分享
err收藏
学者 查看更多内容