Fetching the paper…
Reading the bibliography…
We study the online influence maximization problem in social networks under the independent cascade model.
Maximizing the spread of influence through a social network
David Kempe, Jon Kleinberg, and Éva Tardos · 2003
Earlier work this paper cites.
Stochastic linear optimization under bandit feedback
Varsha Dani, Thomas P Hayes, and Sham M Kakade · 2008
Earlier work this paper cites.
Prediction of information diffusion probabilities for independent cascade model
Kazumi Saito, Ryohei Nakano, and Masahiro Kimura · 2008
Earlier work this paper cites.
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Wei Chen, Chi Wang, and Yajun Wang · 2010
Earlier work this paper cites.
Networks, Crowds, and Markets: Reasoning About a Highly Connected World
David Easley and Jon Kleinberg · 2010
Earlier work this paper cites.
Learning influence probabilities in social networks
Amit Goyal, Francesco Bonchi, and Laks VS Lakshmanan · 2010
Earlier work this paper cites.
Improved algorithms for linear stochastic bandits
Yasin Abbasi-Yadkori, Dávid Pál, and Csaba Szepesvári · 2011
Earlier work this paper cites.
Influence maximization in continuous time diffusion networks
M Gomez Rodriguez, B Schölkopf, Langford J Pineau, et al · 2012
Earlier work this paper cites.
Learning the graph of epidemic cascades
Praneeth Netrapalli and Sujay Sanghavi · 2012
Earlier work this paper cites.
Topic-aware social influence propagation models
Nicola Barbieri, Francesco Bonchi, and Giuseppe Manco · 2013
Earlier work this paper cites.
Social network search as a volatile multi-armed bandit problem
Zahy Bnaya, Rami Puzis, Roni Stern, and Ariel Felner · 2013
Earlier work this paper cites.
Combinatorial multi-armed bandit: General framework, results and applications
Wei Chen, Yajun Wang, and Yang Yuan · 2013
Earlier work this paper cites.
Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships
Yanhua Li, Wei Chen, Yajun Wang, and Zhi-Li Zhang · 2013
Cited alongside, same era.
Networked bandits with disjoint linear payoffs
Meng Fang and Dacheng Tao · 2014
Cited alongside, same era.
Snap datasets: Stanford large network dataset collection
Jure Leskovec and Andrej Krevl · 2014
Cited alongside, same era.
Influence maximization: Near-optimal time complexity meets practical efficiency
Youze Tang, Xiaokui Xiao, and Shi Yanchen · 2014
Cited alongside, same era.
Cascading bandits: Learning to rank in the cascade model
Branislav Kveton, Csaba Szepesvari, Zheng Wen, and Azin Ashkan · 2015
Cited alongside, same era.
Combinatorial cascading bandits
Branislav Kveton, Zheng Wen, Azin Ashkan, and Csaba Szepesvari · 2015
Cited alongside, same era.
Online influence maximization in non-stationary social networks
Yixin Bao, Xiaoke Wang, Zhi Wang, Chuan Wu, and Francis C. M. Lau · 2016
Closest in time.
Revealing graph bandits for maximizing local influence
Alexandra Carpentier and Michal Valko · 2016
Closest in time.
Combinatorial multi-armed bandit and its extension to probabilistically triggered arms
Wei Chen, Yajun Wang, and Yang Yuan · 2016
Closest in time.
Multistage campaigning in social networks
Mehrdad Farajtabar, Xiaojing Ye, Sahar Harati, Le Song, and Hongyuan Zha · 2016
Closest in time.
node2vec: Scalable feature learning for networks
Aditya Grover and Jure Leskovec · 2016
Closest in time.
Bandits on graphs and structures
Michal Valko · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Tight regret bounds for stochastic combinatorial semi-bandits
Branislav Kveton, Zheng Wen, Azin Ashkan, and Csaba Szepesvari · 2015
Cited alongside, same era.
Online influence maximization
Siyu Lei, Silviu Maniu, Luyi Mo, Reynold Cheng, and Pierre Senellart · 2015
Cited alongside, same era.
Information gathering in networks via active exploration
Adish Singla, Eric Horvitz, Pushmeet Kohli, Ryen White, and Andreas Krause · 2015
Cited alongside, same era.
Influence maximization with bandits
Sharan Vaswani, Laks. V. S. Lakshmanan, and Mark Schmidt · 2015
Cited alongside, same era.
Efficient learning in large-scale combinatorial semi-bandits
Zheng Wen, Branislav Kveton, and Azin Ashkan · 2015
Cited alongside, same era.
Adaptive influence maximization in social networks: Why commit when you can adapt?
Sharan Vaswani and Laks V. S. Lakshmanan · 2016
Closest in time.
Cascading bandits for large-scale recommendation problems
Shi Zong, Hao Ni, Kenny Sung, Nan Rosemary Ke, Zheng Wen, and Branislav Kveton · 2016
Closest in time.
Effective large-scale online influence maximization
Paul Lagrée, Olivier Cappé, Bogdan Cautis, and Silviu Maniu · 2017
Closest in time.
Model-independent online learning for influence maximization
Sharan Vaswani, Branislav Kveton, Zheng Wen, Mohammad Ghavamzadeh, Laks VS Lakshmanan, and Mark Schmidt · 2017
Closest in time.
Improving regret bounds for combinatorial semi-bandits with probabilistically triggered arms and its applications
Qinshi Wang and Wei Chen · 2017
Closest in time.