Accepted Papers

Factorization Bandits for Online Influence Maximization

Qingyun Wu (University of Virginia);Zhige Li (Shanghai Jiao Tong University);Huazheng Wang (University of Virginia);Wei Chen (Microsoft);Hongning Wang (University of Virginia);


In this paper, we study the problem of online influence maximization in social networks. In this problem, a learner aims to identify the set of “best influencers” in a network by interacting with the network, i.e., repeatedly selecting seed nodes and observing activation feedback in the network. We capitalize on an important property of the influence maximization problem named network assortativity, which is ignored by most existing works in online influence maximization. To realize network assortativity, we factorize the activation probability on the edges into latent factors on the corresponding nodes, including influence factor on the giving nodes and susceptibility factor on the receiving nodes. We propose an upper confidence bound based online learning solution to estimate the latent factors, and therefore the activation probabilities. Considerable regret reduction is achieved by our factorization based online influence maximization algorithm. Extensive empirical evaluations on two real-world networks showed the effectiveness of our proposed solution.

Download

How can we assist you?

We'll be updating the website as information becomes available. If you have a question that requires immediate attention, please feel free to contact us. Thank you!

Please enter the word you see in the image below: