ExcUseMe: Asking Users to Help in Item Cold-Start Recommendations

The item cold-start problem is of a great importance in collaborative filtering (CF) recommendation systems. It arises when new items are added to the inventory and the system cannot model them properly since it relies solely on historical users' interactions (e.g., ratings). Much work has been devoted to mitigate this problem mostly by employing hybrid approaches that combine content-based recommendation techniques or by devoting a portion of the user traffic for exploration to gather interactions from random users. We focus on pure CF recommender systems (i.e., without content or context information) in a realistic online setting, where random exploration is inefficient and smart exploration that carefully selects users is crucial due to the huge flux of new items with short lifespan. We further assume that users arrive randomly one after the other and that the system has to immediately decide whether the arriving user will participate in the exploration of the new items. For this setting we present ExcUseMe, a smart exploration algorithm that selects a predefined number of users for exploring new items. ExcUseMe gradually excavates the users that are more likely to be interested in the new items and models the new items based on the users' interactions. We evaluated ExcUseMe on several datasets and scenarios and compared it to state-of-the-art algorithms. Experimental results indicate that ExcUseMe is an efficient algorithm that outperforms all other algorithms in all tested scenarios.

[1]  Roy Schwartz,et al.  Improved competitive ratios for submodular secretary problems , 2011 .

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

[3]  Domonkos Tikk,et al.  Investigation of Various Matrix Factorization Methods for Large Recommender Systems , 2008, 2008 IEEE International Conference on Data Mining Workshops.

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

[5]  Joseph Naor,et al.  Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) , 2011, APPROX-RANDOM.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[21]  Morteza Zadimoghaddam,et al.  Submodular secretary problem and extensions , 2013, TALG.

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

[23]  Aaron Roth,et al.  Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms , 2010, WINE.

[24]  Oren Somekh,et al.  Budget-Constrained Item Cold-Start Handling in Collaborative Filtering Recommenders via Optimal Design , 2014, WWW.

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

[26]  Michael J. Pazzani,et al.  Content-Based Recommendation Systems , 2007, The Adaptive Web.

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