Collaborative filtering filling miss values algorithm based on co-rating matrix
Hong Zhi Yu · Jisuanji yingyong yanjiu · 2009
In order to solve the sparsity of ratings problem in collaborative filtering,this paper proposed a new filling miss va-lues algorithm.Firstly,defined the co-rating matrix.Secondly,proposed a filling miss values algorithm based on the co-rating matrix,which worked well through the change of the similarity relation on the co-rating matrix.Experimental results show that the algorithm can effectively solve the data sparse problem and improve the quality of the recommendation.