Active Learning for Recommender Systems

Recommender systems learn user preferences and provide them personalized recommendations. Evidently, the performance of recommender systems depends on the amount of information that users provide regarding items, most often in the form of ratings. This problem is amplified for new users because they have not provided any rating, which impacts negatively on the quality of generated recommendations. This problem is called new-user problem. A simple and effective way to overcome this problem is posing queries to new users so that they express their preferences about selected items, e.g., by rating them. Nevertheless, the selection of items must take into consideration that users are not willing to answer a lot of such queries. To address this problem, active learning methods have been proposed to acquire the most informative ratings, i.e., ratings from users that will help most in determining their interests. Active learning is a learning algorithm that is able to interactively query the Oracle to obtain labels for data instances. The Oracle is a user or teacher who knows the labels. The aim of this dissertation [8] is to take inspiration from the literature of active learning for classification (regression) problems and develop new methods for the new-user problem in recommender systems. In the recommender system context, new users play the role of the Oracle and provide ratings (labels) to items (data instances). Specifically, the following questions are addressed in this dissertation: (1) which recommendation model is suitable for active-learning purposes? (Sect. 2) (2) how can active learning criteria be adapted and customized for the new-user problem and which one is the best? (Sect. 3) (3) what are the specific requirements and properties of the new-user problem that do not exist in active learning and how can new active learning methods be developed based on these properties? (Sects. 4, 5).

[1]  Yehuda Koren,et al.  Adaptive bootstrapping of recommender systems using decision trees , 2011, WSDM '11.

[2]  Lars Schmidt-Thieme,et al.  Online-updating regularized kernel matrix factorization models for large-scale recommender systems , 2008, RecSys '08.

[3]  Greg Schohn,et al.  Less is More: Active Learning with Support Vector Machines , 2000, ICML.

[4]  Yiming Yang,et al.  Personalized active learning for collaborative filtering , 2008, SIGIR '08.

[5]  Luo Si,et al.  A Bayesian Approach toward Active Learning for Collaborative Filtering , 2004, UAI.

[6]  Lars Schmidt-Thieme,et al.  Non-myopic active learning for recommender systems based on Matrix Factorization , 2011, 2011 IEEE International Conference on Information Reuse & Integration.

[7]  David A. Cohn,et al.  Active Learning with Statistical Models , 1996, NIPS.

[8]  Masashi Sugiyama,et al.  Active Learning in Recommender Systems , 2011, Recommender Systems Handbook.

[9]  Kun Deng,et al.  Balancing exploration and exploitation: a new algorithm for active machine learning , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[10]  Shuang-Hong Yang,et al.  Functional matrix factorizations for cold-start recommendation , 2011, SIGIR.

[11]  Lars Schmidt-Thieme,et al.  Towards Optimal Active Learning for Matrix Factorization in Recommender Systems , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[12]  Lars Schmidt-Thieme,et al.  Factorized Decision Trees for Active Learning in Recommender Systems , 2013, 2013 IEEE 25th International Conference on Tools with Artificial Intelligence.