Fetching the paper…
Reading the bibliography…
We consider influence maximization (IM) in social networks, which is the problem of maximizing the number of users that become aware of a product by selecting a set of "seed" users to expose the product to.
Methods of conjugate gradients for solving linear systems , volume 49
Hestenes, Magnus Rudolph and Stiefel, Eduard · 1952
Earlier work this paper cites.
Accelerated greedy algorithms for maximizing submodular set functions
Minoux, Michel · 1978
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions
Nemhauser, George L, Wolsey, Laurence A, and Fisher, Marshall L · 1978
Earlier work this paper cites.
Maximizing the spread of influence through a social network
Kempe, David, Kleinberg, Jon, and Tardos, Éva · 2003
Earlier work this paper cites.
Learning multiple tasks with kernel methods
Evgeniou, Theodoros, Micchelli, Charles A, and Pontil, Massimiliano · 2005
Earlier work this paper cites.
Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication
Leskovec, Jurij, Chakrabarti, Deepayan, Kleinberg, Jon, and Faloutsos, Christos · 2005
Earlier work this paper cites.
Manifold regularization: A geometric framework for learning from labeled and unlabeled examples
Belkin, Mikhail, Niyogi, Partha, and Sindhwani, Vikas · 2006
Earlier work this paper cites.
Cost-effective outbreak detection in networks
Leskovec, Jure, Krause, Andreas, Guestrin, Carlos, Faloutsos, Christos, VanBriesen, Jeanne, and Glance, Natalie · 2007
Earlier work this paper cites.
A tutorial on spectral clustering
Von Luxburg, Ulrike · 2007
Earlier work this paper cites.
Stochastic linear optimization under bandit feedback
Dani, Varsha, Hayes, Thomas P, and Kakade, Sham M · 2008
Earlier work this paper cites.
Prediction of information diffusion probabilities for independent cascade model
Saito, Kazumi, Nakano, Ryohei, and Kimura, Masahiro · 2008
Earlier work this paper cites.
Efficient influence maximization in social networks
Chen, Wei, Wang, Yajun, and Yang, Siyu · 2009
Earlier work this paper cites.
Learning influence probabilities in social networks
Goyal, Amit, Bonchi, Francesco, and Lakshmanan, Laks VS · 2010
Earlier work this paper cites.
Kronecker graphs: An approach to modeling networks
Leskovec, Jure, Chakrabarti, Deepayan, Kleinberg, Jon, Faloutsos, Christos, and Ghahramani, Zoubin · 2010
Cited alongside, same era.
Improved algorithms for linear stochastic bandits
Abbasi-Yadkori, Yasin, Pál, Dávid, and Szepesvári, Csaba · 2011
Cited alongside, same era.
Simpath: An efficient algorithm for influence maximization under the linear threshold model
Goyal, Amit, Lu, Wei, and Lakshmanan, Laks VS · 2011
Cited alongside, same era.
Influence maximization in continuous time diffusion networks
Gomez Rodriguez, M, Schölkopf, B, Pineau, Langford J, et al · 2012
Cited alongside, same era.
Submodular function maximization
Krause, Andreas and Golovin, Daniel · 2012
Cited alongside, same era.
Learning the graph of epidemic cascades
Netrapalli, Praneeth and Sanghavi, Sujay · 2012
Cited alongside, same era.
Deepwalk: Online learning of social representations
Perozzi, Bryan, Al-Rfou, Rami, and Skiena, Steven · 2014
Later among the works it cites.
Influence maximization: Near-optimal time complexity meets practical efficiency
Tang, Youze, Xiao, Xiaokui, and Yanchen, Shi · 2014
Later among the works it cites.
Spectral bandits for smooth graph functions
Valko, Michal, Munos, Rémi, Kveton, Branislav, and Kocák, Tomáš · 2014
Later among the works it cites.
Tight regret bounds for stochastic combinatorial semi-bandits
Kveton, Branislav, Wen, Zheng, Ashkan, Azin, and Szepesvari, Csaba · 2015
Later among the works it cites.
Online influence maximization
Lei, Siyu, Maniu, Silviu, Mo, Luyi, Cheng, Reynold, and Senellart, Pierre · 2015
Later among the works it cites.
Influence maximization in near-linear time: A martingale approach
Tang, Youze, Shi, Yanchen, and Xiao, Xiaokui · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Topic-aware social influence propagation models
Barbieri, Nicola, Bonchi, Francesco, and Manco, Giuseppe · 2013
Cited alongside, same era.
A gang of bandits
Cesa-Bianchi, Nicolo, Gentile, Claudio, and Zappella, Giovanni · 2013
Cited alongside, same era.
Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships
Li, Yanhua, Chen, Wei, Wang, Yajun, and Zhang, Zhi-Li · 2013
Cited alongside, same era.
Influence Function Learning in Information Diffusion Networks
Du, Nan, Liang, Yingyu, Balcan, Maria-Florina, and Song, Le · 2014
Cited alongside, same era.
Networked bandits with disjoint linear payoffs
Fang, Meng and Tao, Dacheng · 2014
Cited alongside, same era.
Online clustering of bandits
Gentile, Claudio, Li, Shuai, and Zappella, Giovanni · 2014
Cited alongside, same era.
Influence maximization with bandits
Vaswani, Sharan, Lakshmanan, Laks. V. S., and Mark Schmidt · 2015
Later among the works it cites.
Efficient learning in large-scale combinatorial semi-bandits
Wen, Zheng, Kveton, Branislav, and Ashkan, Azin · 2015
Later among the works it cites.
Revealing graph bandits for maximizing local influence
Carpentier, Alexandra and Valko, Michal · 2016
Later among the works it cites.
Combinatorial multi-armed bandit and its extension to probabilistically triggered arms
Chen, Wei, Wang, Yajun, Yuan, Yang, and Wang, Qinshi · 2016
Later among the works it cites.
node2vec: Scalable feature learning for networks
Grover, Aditya and Leskovec, Jure · 2016
Later among the works it cites.
Horde of bandits using gaussian markov random fields
Vaswani, Sharan, Schmidt, Mark, and Lakshmanan, Laks · 2017
Closest in time.
Online influence maximization under independent cascade model with semi-bandit feedback
Wen, Zheng, Kveton, Branislav, Valko, Michal, and Vaswani, Sharan · 2017
Closest in time.