Exploiting explicit and implicit feedback for personalized ranking
Summary: The problem of the previous researches on personalized ranking is that they focused on either explicit feedback data or implicit feedback data rather than making full use of the information in the dataset. Until now, nobody has studied personalized ranking algorithm by exploiting both explicit and implicit feedback. In order to overcome the defects of prior researches, a new personalized ranking algorithm (MERR\(\_\)SVD++) based on the newest xCLiMF model and SVD++ algorithm was proposed, which exploited both explicit and implicit feedback simultaneously and optimized the well-known evaluation metric Expected Reciprocal Rank (ERR). Experimental results on practical datasets showed that our proposed algorithm outperformed existing personalized ranking algorithms over different evaluation metrics and that the running time of MERR\(\_\)SVD++ showed a linear correlation with the number of rating. Because of its high precision and the good expansibility, MERR\(\_\)SVD++ is suitable for processing big data and has wide application prospect in the field of internet information recommendation.
- Scalable Collaborative Ranking for Personalized Prediction
- scientific article; zbMATH DE number 5940804
- A matrix factorization algorithm with hybrid implicit and explicit attributes for recommender systems
- SVD-based incremental approaches for recommender systems
- An Alternative Ranking Problem for Search Engines
This page was built for publication: Exploiting explicit and implicit feedback for personalized ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1792853)
