ABSTRACT
Most of the current recommender systems heavily rely on explicit user feedback such as ratings on items to model users' interests. However, in many applications, it is very hard to collect the explicit feedback, while implicit feedback such as user clicks may be more available. Furthermore, it is often more suitable for many recommender systems to address a ranking problem than a rating predicting problem. This paper proposes a latent pairwise preference learning (LPPL) approach for recommendation with implicit feedback. LPPL directly models user preferences with respect to a set of items rather than the rating scores on individual items, which are modeled with a set of features by analyzing clickthrough data available in many real-world recommender systems. The LPPL approach models both the latent variables of group structure of users and the pairwise preferences simultaneously. We conduct experiments on the testbed from a real-world recommender system and demonstrate that the proposed approach can effectively improve the recommendation performance against several baseline algorithms.
- J. Akinyemi. Similarity and Diversity in Information Retrieval. PhD thesis, University of Waterloo, 2012.Google Scholar
- W. Cohen, R. Schapire, and Y. Singer. Learning to order things. Journal of Artificial Intelligence Research, 10:243--270, 1999. Google ScholarCross Ref
- M. De Gemmis, L. Iaquinta, P. Lops, C. Musto, F. Narducci, and G. Semeraro. Preference learning in recommender systems. 2009.Google Scholar
- Y. Fang and L. Si. Matrix co-factorization for recommendation with rich side information and implicit feedback. In RecSys Workshop, pages 65--69, 2011. Google ScholarDigital Library
- T. Hofmann. Collaborative filtering via gaussian probabilistic latent semantic analysis. In SIGIR, pages 259--266, 2003. Google ScholarDigital Library
- Y. Hu, Y. Koren, and C. Volinsky. Collaborative filtering for implicit feedback datasets. In ICDM, pages 263--272, 2008. Google ScholarDigital Library
- T. Joachims. Optimizing search engines using clickthrough data. In SIGKDD, pages 133--142, 2002. Google ScholarDigital Library
- N. Liu, M. Zhao, and Q. Yang. Probabilistic latent preference analysis for collaborative filtering. In CIKM, pages 759--766, 2009. Google ScholarDigital Library
- T. Liu. Learning to rank for information retrieval. Foundations and Trends in Information Retrieval, 3(3):225--331, 2009. Google ScholarDigital Library
- J. Nocedal and S. Wright. Numerical optimization. Springer Verlag, 1999.Google ScholarCross Ref
Index Terms
- A latent pairwise preference learning approach for recommendation from implicit feedback
Recommendations
Using Implicit Feedback for Neighbors Selection: Alleviating the Sparsity Problem in Collaborative Recommendation Systems
WebMedia '17: Proceedings of the 23rd Brazillian Symposium on Multimedia and the WebThe most popular Recommender systems (RSs) employ Collaborative Filtering (CF) algorithms where users explicitly rate items. Based on these ratings, a user-item rating matrix is generated and used to select the items to be recommended for a target user. ...
Multiple Pairwise Ranking with Implicit Feedback
CIKM '18: Proceedings of the 27th ACM International Conference on Information and Knowledge ManagementAs users implicitly express their preferences to items on many real-world applications, the implicit feedback based collaborative filtering has attracted much attention in recent years. Pairwise methods have shown state-of-the-art solutions for dealing ...
Personalized recommendation with implicit feedback via learning pairwise preferences over item-sets
Preference learning is a fundamental problem in various smart computing applications such as personalized recommendation. Collaborative filtering as a major learning technique aims to make use of users' feedback, for which some recent works have ...
Comments