Spectral Bandits for Smooth Graph Functions with Applications in Recommender Systems
暂无分享,去创建一个
Rémi Munos | Michal Valko | Branislav Kveton | Shipra Agrawal | Tomáš Kocák | R. Munos | B. Kveton | Michal Valko | Shipra Agrawal | Tomás Kocák
[1] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[2] Wei Chu,et al. A contextual-bandit approach to personalized news article recommendation , 2010, WWW '10.
[3] Mikhail Belkin,et al. Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples , 2006, J. Mach. Learn. Res..
[4] Gary L. Miller,et al. Approaching Optimality for Solving SDD Linear Systems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[5] Rémi Munos,et al. Spectral Thompson Sampling , 2014, AAAI.
[6] M. McPherson,et al. Birds of a Feather: Homophily in Social Networks , 2001 .
[7] Michael J. Pazzani,et al. A learning agent for wireless news access , 2000, IUI '00.
[8] Mikhail Belkin,et al. Regularization and Semi-supervised Learning on Large Graphs , 2004, COLT.
[9] Peter Auer,et al. Using Confidence Bounds for Exploitation-Exploration Trade-offs , 2003, J. Mach. Learn. Res..
[10] Michael J. Pazzani,et al. Content-Based Recommendation Systems , 2007, The Adaptive Web.
[11] Rémi Munos,et al. Spectral Bandits for Smooth Graph Functions , 2014, ICML.
[12] Gerhard Friedrich,et al. Recommender Systems - An Introduction , 2010 .
[13] Xiaojin Zhu,et al. Semi-Supervised Learning Literature Survey , 2005 .