Exploiting the characteristics of matrix factorization for active learning in recommender systems

  • Authors:
  • Rasoul Karimi;Christoph Freudenthaler;Alexandros Nanopoulos;Lars Schmidt-Thieme

  • Affiliations:
  • University of Hildesheim, Hildesheim, Germany;University of Hildesheim, Hildesheim, Germany;University of Hildesheim, Hildesheim, Germany;University of Hildesheim, Hildesheim, Germany

  • Venue:
  • Proceedings of the sixth ACM conference on Recommender systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recommender systems help web users to address information overload. However their performance depends on the number of provided ratings by users. This problem is amplified for a new user because he/she has not provided any rating. To address this problem, active learning methods have been proposed to acquire those ratings from users, that will help most in determining their interests. However, different from the classic active learning, users (the "oracle") are not always able to provide an answer for queries. The easiest way to solve this problem is to ask most popular items, i.e items which have received many ratings from training users. But it is static and presents the same items to all users regardless of the ratings they have provided so far. In this paper we propose a method that improves the most popular selection strategy using the characteristics of matrix factorization. It finds similar users to the new user in the latent space and then selects item which is most popular among the similar users. The experimental results show the proposed method outperforms the most popular method both in terms of error and the number of received ratings.