Learning rating patterns for top-N recommendations
conference contribution
posted on 2024-10-31, 17:15authored byYongli RenYongli Ren, Gang Li, Wanlei Zhou
Two rating patterns exist in the user x 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 x 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 x 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.
History
Start page
472
End page
479
Total pages
8
Outlet
Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)