Mixing bandits: A recipe for improved cold-start recommendations in a social network

Proceedings of the 7th Workshop on Social Network Mining and Analysis, SNA-KDD 2013

Volumn , Issue , 2013, Pages

  Caron, Stéphane ^a   Bhagat, Smriti ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b Technicolor Inc   (United States)

Author keywords

Cold start problem; Multi armed multi bandits; Recommender systems; Social networks

Indexed keywords

ARTIFICIAL INTELLIGENCE; COLLABORATIVE FILTERING;

COLD START PROBLEMS; COLD-START; COLD-START RECOMMENDATIONS; LEARN+; LEARNING RATES; MULTI-ARMED MULTI-BANDIT; MULTIARMED BANDITS (MABS); NEIGHBOURHOOD; NOVEL STRATEGIES; SOCIAL NETWORK;

RECOMMENDER SYSTEMS;

EID: 84890701499     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2501025.2501029     Document Type: Conference Paper

References (24)

1. G. Adomavicius and A. Tuzhilin. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Trans. on Knowl. and Data Eng., 2005.
2. D. Agarwal and B.-C. Chen. Machine learning for large scale recommender systems. Tutorial at ICML 2011 available at http://pages.cs.wisc.edu/~beechung/ icml11-tutorial/.
3. J.-Y. Audibert, R. Munos, and C. Szepesvari. Tuning bandit algorithms in stochastic environments. Algorithmic Learning Theory, pages 150-165, 2007.
4. P. Auer. Using confidence bounds for exploitation-exploration trade-offs. J. Mach. Learn. Res., 3:397-422, Mar. 2003.
5. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2):235-256, 2002.
6. S. Bubeck, R. Munos, G. Stoltz, and C. Szepesvári. X-armed bandits. Journal of Machine Learning Research, 12:1655-1695, 2011.
7. S. Caron, B. Kveton, M. Lelarge, and S. Bhagat. Leveraging side observations in stochastic bandits. In UAI, 2012.
8. D. Crandall, D. Cosley, D. Huttenlocher, J. Kleinberg, and S. Suri. Feedback effects between similarity and social influence in online communities. In KDD, 2008.
9. V. Dani, T. P. Hayes, and S. M. Kakade. Stochastic linear optimization under bandit feedback. In Computational Learning Theory, pages 355-366, 2008.
10. R. V. Hogg and A. Craig. Introduction to Mathematical Statistics. Macmillan, 1978.
11. Y. Hu, Y. Koren, and C. Volinsky. Collaborative filtering for implicit feedback datasets. In Eighth IEEE International Conference on Data Mining, 2008.
12. M. Jamali and M. Ester. Trustwalker: A random walk model for combining trust-based and item-based recommendation. In KDD, 2009.
13. Y. Koren and R. Bell. Advances in collaborative filtering. In Recommender Systems Handbook. 2011.
14. T. L. Lai and H. Robbins. Asymptotically efficient adaptive allocation rules. Adv. in Appl. Math., 6(1):4-22, 1985.
15. C. Lam. Snack: incorporating social network information in automated collaborative filtering. In EC, 2004.
16. V. Leroy, B. B. Cambazoglu, and F. Bonchi. Cold start link prediction. In KDD, 2010.
17. L. Li, W. Chu, J. Langford, and R. E. Schapire. A contextual-bandit approach to personalized news article recommendation. In WWW, 2010.
18. S. Mannor and O. Shamir. From bandits to experts: On the value of side-observations. In NIPS, 2011.
19. J. Noel, S. Sanner, K.-N. Tran, P. Christen, L. Xie, E. V. Bonilla, E. Abbasnejad, and N. Della Penna. New objective functions for social collaborative filtering. In WWW, 2012.
20. S. Pandey, D. Chakrabarti, and D. Agarwal. Multi-armed bandit problems with dependent arms. In ICML, 2007.
21. S.-T. Park and W. Chu. Pairwise preference regression for cold-start recommendation. In RecSys, 2009.
22. S.-T. Park, D. Pennock, O. Madani, N. Good, and D. DeCoste. Naïve filterbots for robust cold-start recommendations. In KDD, 2006.
23. P. Rusmevichientong and J. N. Tsitsiklis. Linearly parameterized bandits. Math. Oper. Res., 35(2):395-411, May 2010.
24. A. I. Schein, A. Popescul, L. H. Ungar, and D. M. Pennock. Methods and metrics for cold-start recommendations. In SIGIR, 2002.