Wisdom of the better few: cold start recommendation via representative based rating elicitation

Recommender systems have to deal with the cold start problem as new users and/or items are always present. Rating elicitation is a common approach for handling cold start. However, there still lacks a principled model for guiding how to select the most useful ratings. In this paper, we propose a principled approach to identify representative users and items using representative-based matrix factorization. Not only do we show that the selected representatives are superior to other competing methods in terms of achieving good balance between coverage and diversity, but we also demonstrate that ratings on the selected representatives are much more useful for making recommendations (about 10% better than competing methods). In addition to illustrating how representatives help solve the cold start problem, we also argue that the problem of finding representatives itself is an important problem that would deserve further investigations, for both its practical values and technical challenges.

[1]  Foster Provost,et al.  Audience selection for on-line brand advertising: privacy-friendly social network targeting , 2009, KDD.

[2]  Wendy R. Fox,et al.  Finding Groups in Data: An Introduction to Cluster Analysis , 1991 .

[3]  Harald Steck,et al.  Training and testing of recommender systems on data missing not at random , 2010, KDD.

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

[5]  Henry Lieberman,et al.  Intelligent profiling by example , 2001, IUI '01.

[6]  C. Pan On the existence and computation of rank-revealing LU factorizations , 2000 .

[7]  S. Goreinov,et al.  How to find a good submatrix , 2010 .

[8]  Santosh S. Vempala,et al.  Adaptive Sampling and Fast Low-Rank Matrix Approximation , 2006, APPROX-RANDOM.

[9]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

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

[11]  M. Magdon-Ismail,et al.  Finding Maximum Volume Sub-matrices of a Matrix , 2007 .

[12]  Richard S. Zemel,et al.  Collaborative prediction and ranking with non-random missing data , 2009, RecSys '09.

[13]  Jimeng Sun,et al.  Less is More: Compact Matrix Decomposition for Large Sparse Graphs , 2007, SDM.

[14]  Nathaniel Good,et al.  Naïve filterbots for robust cold-start recommendations , 2006, KDD '06.

[15]  Edward Y. Chang,et al.  AdHeat: an influence-based diffusion model for propagating hints to match ads , 2010, WWW '10.

[16]  Xavier Amatriain,et al.  The wisdom of the few: a collaborative filtering approach based on expert opinions from the web , 2009, SIGIR.

[17]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[18]  Lars Schmidt-Thieme,et al.  Learning Attribute-to-Feature Mappings for Cold-Start Recommendations , 2010, 2010 IEEE International Conference on Data Mining.

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

[20]  Pauli Miettinen,et al.  Interpretable nonnegative matrix decompositions , 2008, KDD.

[21]  Rajesh Parekh,et al.  Predicting product adoption in large-scale social networks , 2010, CIKM.