• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2013, Vol. 35 ›› Issue (5): 15-19.

• 论文 • Previous Articles     Next Articles

Applying data filling to alleviate the sparsity
problem for personalized recommendation

XIA Jianxun1,2,4,WU Fei2,3,4,XIE Changsheng2,3,4   

  1. (1.School of Computer and Information Science,Hubei Engineering University,Xiaogan 432100;
    2.Wuhan National Laboratory for Optoelectronics,Wuhan 430074;
    3.Key Laboratory of Data Storage Systems,Ministry of Education of China,Wuhan 430074;
    4.School of Computer Science and Technology,Huazhong University of Science and Technology,Wuhan 430074,China)
  • Received:2012-05-16 Revised:2012-09-20 Online:2013-05-25 Published:2013-05-25

Abstract:

Till now, collaborative filtering has been the most successful and widely used technology in recommender systems. However, the rating data is extremely sparse so as to affect the prediction accuracy seriously in traditional collaborative filtering. In order to overcome the drawback, in this paper, we proposed three data filling approaches and two recommendation strategies. These data filling approaches for non-rating data in rating matrix are: (1) Filling data using weighed average of row and column data; (2) Filling data using mode average of row and column data; and (3) Filling data using median average of row and column data. One of the recommendation strategies is taking filling data for predicative rating directly, and another is to set the rating matrix filled data as a pseudo rating matrix and collaborative filtering applying Pearson correlation. The experimental results on the MovieLens data set show that all these recommendation strategies can effectively alleviate the trouble of rating data sparseness and gain better recommendation accuracy.

Key words: recommender system;personalized recommendation;collaborative filtering;data filling