A learning method for top-n recommendations with incomplete data

Ren, Y, Li, G and Zhou, W 2013, 'A learning method for top-n recommendations with incomplete data', Social Network Analysis and Mining, vol. 3, no. 4, pp. 1135-1148.


Document type: Journal Article
Collection: Journal Articles

Title A learning method for top-n recommendations with incomplete data
Author(s) Ren, Y
Li, G
Zhou, W
Year 2013
Journal name Social Network Analysis and Mining
Volume number 3
Issue number 4
Start page 1135
End page 1148
Total pages 14
Publisher Springer
Abstract In this paper, we tackle the incompleteness of user rating history in the context of collaborative filtering for Top-N recommendations. Previous research ignore a fact that two rating patterns exist in the user × item rating matrix and influence each other. More importantly, their interactive influence characterizes the development of each other, which can consequently be exploited to improve the modelling of rating patterns, especially when the user × item rating matrix is highly incomplete due to the well-known data sparsity issue. This paper proposes a Rating Pattern Subspace to iteratively re-optimize the missing values in each user's rating history by modelling both the global and the personal rating patterns simultaneously. The basic idea is to project the user × item rating matrix on a low-rank subspace to capture the global rating patterns. Then, the projection of each individual user on the subspace is further optimized according to his/her own rating history and the captured global rating patterns. Finally, the optimized user projections are used to improve the modelling of the global rating patterns. Based on this subspace, we propose a RapSVD-L algorithm for Top-N recommendations. In the experiments, the performance of the proposed method is compared with the state-of-the-art Top-N recommendation methods on two real datasets under various data sparsity levels. The experimental results show that RapSVD-L outperforms the compared algorithms not only on the all items recommendations but also on the long tail item recommendations in terms of accuracy.
Subject Pattern Recognition and Data Mining
Information Retrieval and Web Search
Keyword(s) Rating patterns
top-N recommendations
DOI - identifier 10.1007/s13278-013-0103-2
Copyright notice © Springer-Verlag Wien 2013
ISSN 1869-5469
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 4 times in Scopus Article | Citations
Altmetric details:
Access Statistics: 205 Abstract Views  -  Detailed Statistics
Created: Mon, 13 Jan 2014, 14:39:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us