Mathematical Problems in Engineering · 2016 · 102 citations · 22 references
ComputingComputer ScienceBig Data AnalyticsData MiningRecommender SystemsOnline RecommendationPersonalizationRecommendation EvaluationRecommendation SystemsEvaluation MetricsExpected Reciprocal RankFeedback-based RankingImplicit FeedbackPerformance Evaluation MetricsPersonalized RankingRanking AlgorithmsReciprocal Rank
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.
22
BPR: Bayesian Personalized Ranking from Implicit Feedback
Steffen Rendle, Christoph Freudenthaler, Zeno Gantner et al. · arXiv (Cornell University) · 2012 · 4.4K citations · Full text
Latent semantic models for collaborative filtering
Thomas Hofmann · ACM Transactions on Information Systems · 2004 · 1.4K citations
Expected reciprocal rank for graded relevance
Olivier Chapelle, Donald Metlzer, Ya Zhang et al. · 2009 · 839 citations
Yehuda Koren · ACM Transactions on Knowledge Discovery from Data · 2010 · 720 citations