Abstract

One-Class Collaborative Filtering (OCCF) has recently received much attention in recommendation communities due to their close relationship with real industry problem settings. However, the problem with previous research studies on OCCF is that they focused on either rating prediction or ranking prediction, but no concerted research effort has been devoted to developing a recommendation approach that simultaneously optimizes both the ratings and rank of the recommended items. In order to overcome the defects of prior research, a new better unified OCCF approach (UOCCF) based on the newest Collaborative Less-is-More Filtering (CLiMF) approach and the Probabilistic Matrix Factorization (PMF) approach was proposed, which benefits from the ranking-oriented perspective and the rating-oriented perspective by sharing common latent features of users and items in CLiMF and PMF. We also provide an efficient learning algorithm to solve the optimization problem for UOCCF. Experimental results on practical datasets showed that our proposed UOCCF approach outperformed existing OCCF approaches (both ranking-oriented and rating-oriented) over different evaluation metrics, and that the UOCCF approach enjoys the advantage of low complexity and is shown to be linear with the number of observed ratings in a given user–item rating matrix. Because of its high precision and good expansibility, UOCCF is suitable for processing big data, and has wide application prospects in the field of internet information recommendation.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.