High Order Profile Expansion to tackle the new user problem on recommender systems

Collaborative Filtering algorithms provide users with recommendations based on their opinions, that is, on the ratings given by the user for some items. They are the most popular and widely implemented algorithms in Recommender Systems, especially in e-commerce, considering their good results. However, when the information is extremely sparse, independently of the domain nature, they do not present such good results. In particular, it is difficult to offer recommendations which are accurate enough to a user who has just arrived to a system or who has rated few items. This is the well-known new user problem, a type of cold-start. Profile Expansion techniques had been already presented as a method to alleviate this situation. These techniques increase the size of the user profile, by obtaining information about user tastes in distinct ways. Therefore, recommender algorithms have more information at their disposal, and results improve. In this paper, we present the High Order Profile Expansion techniques, which combine in different ways the Profile Expansion methods. The results show 110% improvement in precision over the algorithm without Profile Expansion, and 10% improvement over Profile Expansion techniques.

[1]  Victor Carneiro,et al.  Using profile expansion techniques to alleviate the new user problem , 2013, Inf. Process. Manag..

[2]  John Riedl,et al.  An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms , 2002, Information Retrieval.

[3]  Jonathan L. Herlocker,et al.  Evaluating collaborative filtering recommender systems , 2004, TOIS.

[4]  Fernando Ortega,et al.  A collaborative filtering approach to mitigate the new user cold start problem , 2012, Knowl. Based Syst..

[5]  Douglas B. Terry,et al.  Using collaborative filtering to weave an information tapestry , 1992, CACM.

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

[7]  Alexander Maedche,et al.  Using Gamification to Tackle the Cold-Start Problem in Recommender Systems , 2016, CSCW Companion.

[8]  Francesco Ricci,et al.  Rating Elicitation Strategies for Collaborative Filtering , 2011, EC-Web.

[9]  Victor Carneiro,et al.  Improving k-nearest neighbors algorithms: practical application of dataset analysis , 2011, CIKM '11.

[10]  S. Archana,et al.  Systematic approach for cold start issues in recommendations system , 2016, 2016 International Conference on Recent Trends in Information Technology (ICRTIT).

[11]  Hyung Jun Ahn,et al.  A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem , 2008, Inf. Sci..

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

[13]  Jin Liu,et al.  Enhancing the robustness of recommender systems against spammers , 2018, PloS one.

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

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

[16]  Diego Fernández,et al.  Comparison of collaborative filtering algorithms , 2011, ACM Trans. Web.

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

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

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

[20]  Franca Garzotto,et al.  User effort vs. accuracy in rating-based elicitation , 2012, RecSys.

[21]  Slava Kisilevich,et al.  Initial Profile Generation in Recommender Systems Using Pairwise Comparison , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[22]  John Riedl,et al.  GroupLens: an open architecture for collaborative filtering of netnews , 1994, CSCW '94.

[23]  Adriano M. Pereira,et al.  The Pure Cold-Start Problem: A deep study about how to conquer first-time users in recommendations domains , 2019, Inf. Syst..

[24]  Hendrik Blockeel,et al.  Alleviating the Sparsity Problem in Collaborative Filtering by Using an Adapted Distance and a Graph-Based Method , 2010, SDM.