Title :
Learning Rating Patterns for Top-N Recommendations
Author :
Yongli Ren ; Gang Li ; Wanlei Zhou
Author_Institution :
Sch. of Inf. Technol., Deakin Univ., Melbourne, VIC, Australia
Abstract :
Two rating patterns exist in the user × item rating matrix and influence each other: the personal rating patterns are hidden in each user´s entire rating history, while the global rating patterns are hidden in the entire user × item rating matrix. In this paper, a Rating Pattern Subspace is proposed to model both of the rating patterns simultaneously by iteratively refining each other with an EM-like algorithm. Firstly, a low-rank subspace is built up to model the global rating patterns from the whole user × item rating matrix, then, the projection for each user on the subspace is refined individually based on his/her own entire rating history. After that, the refined user projections on the subspace are used to improve the modelling of the global rating patterns. Iteratively, we can obtain a well-trained low-rank Rating Pattern Subspace, which is capable of modelling both the personal and the global rating patterns. Based on this subspace, we propose a RapSVD algorithm to generate Top-N recommendations, and the experiment results show that the proposed method can significantly outperform the other state-of-the-art Top-N recommendation methods in terms of accuracy, especially on long tail item recommendations.
Keywords :
expectation-maximisation algorithm; matrix algebra; pattern recognition; recommender systems; singular value decomposition; EM-like algorithm; RapSVD algorithm; item rating matrix; learning; long tail item recommendations; personal rating patterns; top-N recommendations; Accuracy; History; Matrix decomposition; Motion pictures; Predictive models; Training; Vectors; Rating Patterns; Top-N Recommendations;
Conference_Titel :
Advances in Social Networks Analysis and Mining (ASONAM), 2012 IEEE/ACM International Conference on
Conference_Location :
Istanbul
Print_ISBN :
978-1-4673-2497-7
DOI :
10.1109/ASONAM.2012.81