A market-based approach to address the new item problem

In this paper we propose a market-based approach for seeding recommendations for new items in which publishers bid to have items presented to the most influential users for each item. Users are able to select (or not) items for rating on an earn-per-rating basis, with payment given for providing a rating regardless of whether the rating is positive or negative. This approach reduces the time taken to obtain ratings for new items, while encouraging users to give honest ratings (to increase their influence) which in turn supports the quality of recommendations. To support this approach we propose techniques for inferring the social influence network from users' rating vectors and recommendation lists. Using this influence network we apply existing heuristics for estimating a user's influence, adapting them to account for the new items already presented to a user. We also propose an extension to Chen et al.'s Degree Discount heuristic [Chen et al. 2009], to enable it to be used in this context. We evaluate our approach on the MovieLens dataset and show that we are able to reduce the time taken to achieve coverage, while supporting the quality of recommendations.

[1]  Hsinchun Chen,et al.  Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering , 2004, TOIS.

[2]  Anh Duc Duong,et al.  Addressing cold-start problem in recommendation systems , 2008, ICUIMC '08.

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

[4]  Ravi Kumar,et al.  Influence and correlation in social networks , 2008, KDD.

[5]  David M. Pennock,et al.  Categories and Subject Descriptors , 2001 .

[6]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[7]  Bamshad Mobasher,et al.  Towards Trustworthy Recommender Systems : An Analysis of Attack Models and Algorithm Robustness , 2007 .

[8]  Gerard Salton,et al.  Research and Development in Information Retrieval , 1982, Lecture Notes in Computer Science.

[9]  David Heckerman,et al.  Empirical Analysis of Predictive Algorithms for Collaborative Filtering , 1998, UAI.

[10]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[11]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

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

[13]  Daniel A. Keim,et al.  On Knowledge Discovery and Data Mining , 1997 .

[14]  Jacob Goldenberg,et al.  Using Complex Systems Analysis to Advance Marketing Theory Development , 2001 .

[15]  Alexander Tuzhilin,et al.  The long tail of recommender systems and how to leverage it , 2008, RecSys '08.

[16]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[17]  Yoav Shoham,et al.  Truthful Surveys , 2008, WINE.