Budget-Constrained Item Cold-Start Handling in Collaborative Filtering Recommenders via Optimal Design

It is well known that collaborative filtering (CF) based recommender systems provide better modeling of users and items associated with considerable rating history. The lack of historical ratings results in the user and the item cold-start problems. The latter is the main focus of this work. Most of the current literature addresses this problem by integrating content-based recommendation techniques to model the new item. However, in many cases such content is not available, and the question arises is whether this problem can be mitigated using CF techniques only. We formalize this problem as an optimization problem: given a new item, a pool of available users, and a budget constraint, select which users to assign with the task of rating the new item in order to minimize the prediction error of our model. We show that the objective function is monotone-supermodular, and propose efficient optimal design based algorithms that attain an approximation to its optimum. Our findings are verified by an empirical study using the Netflix dataset, where the proposed algorithms outperform several baselines for the problem at hand.

[1]  Deepak Agarwal,et al.  Regression-based latent factor models , 2009, KDD.

[2]  Yehuda Koren,et al.  Build your own music recommender by modeling internet radio streams , 2012, WWW.

[3]  Victor P. Il'ev,et al.  An Approximation Guarantee of the Greedy Descent Algorithm for Minimizing a Supermodular Set Function , 2001, Discret. Appl. Math..

[4]  Sean M. McNee,et al.  Getting to know you: learning new user preferences in recommender systems , 2002, IUI '02.

[5]  Yehuda Koren,et al.  Factorization meets the neighborhood: a multifaceted collaborative filtering model , 2008, KDD.

[6]  Yehuda Koren,et al.  Collaborative filtering with temporal dynamics , 2009, KDD.

[7]  Yehuda Koren,et al.  Dynamic personalized recommendation of comment-eliciting stories , 2012, RecSys '12.

[8]  Yehuda Koren,et al.  Yahoo! music recommendations: modeling music ratings with temporal dynamics and item taxonomy , 2011, RecSys '11.

[9]  James Bennett,et al.  The Netflix Prize , 2007 .

[10]  Guillaume Sagnol,et al.  Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs , 2010, Discret. Appl. Math..

[11]  Shao-Lun Lee Commodity recommendations of retail business based on decisiontree induction , 2010, Expert Syst. Appl..

[12]  Yehuda Koren,et al.  On bootstrapping recommender systems , 2010, CIKM.

[13]  Jinbo Bi,et al.  Active learning via transductive experimental design , 2006, ICML.

[14]  John Riedl,et al.  Learning preferences of new users in recommender systems: an information theoretic approach , 2008, SKDD.

[15]  Wei Chu,et al.  Information Services]: Web-based services , 2022 .

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

[17]  Yoram Singer,et al.  Adaptive Subgradient Methods for Online Learning and Stochastic Optimization , 2011, J. Mach. Learn. Res..

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

[19]  Patrick Seemann,et al.  Matrix Factorization Techniques for Recommender Systems , 2014 .

[20]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[21]  Yehuda Koren,et al.  Matrix Factorization Techniques for Recommender Systems , 2009, Computer.

[22]  Christopher Meek,et al.  A unified approach to building hybrid recommender systems , 2009, RecSys '09.

[23]  W. Näther Optimum experimental designs , 1994 .

[24]  Greg Linden,et al.  Amazon . com Recommendations Item-to-Item Collaborative Filtering , 2001 .

[25]  Andreas Krause,et al.  Near-optimal Observation Selection using Submodular Functions , 2007, AAAI.

[26]  Arnd Kohrs,et al.  Improving collaborative filtering for new-users by smart object selection , 2001 .

[27]  Christos Boutsidis,et al.  Greedy Minimization of Weakly Supermodular Set Functions , 2015, APPROX-RANDOM.

[28]  Padhraic Smyth,et al.  KDD Cup and workshop 2007 , 2007, SKDD.

[29]  Christopher Meek,et al.  Tied boltzmann machines for cold start recommendations , 2008, RecSys '08.

[30]  Arkadiusz Paterek,et al.  Improving regularized singular value decomposition for collaborative filtering , 2007 .

[31]  Changbao Wu,et al.  Some Algorithmic Aspects of the Theory of Optimal Designs , 1978 .