An Efficient and Effective Method to Find Uninteresting Items for Accurate Collaborative Filtering

Abstract

Collaborative filtering methods suffer from a data sparsity problem, which indicates that the accuracy of recommendation decreases when the user-item matrix used in recommendation is sparse. To alleviate the data sparsity problem, researches on data imputation have been done. In particular, the zero-injection method, which finds uninteresting items and imputes zero values to those items for collaborative filtering, achieves significant improvement in terms of recommendation accuracy. However, the existing zero-injection method employs the One-Class Collaborative Filtering (OCCF) method that requires a lot of time. In this paper, we propose a fast method that finds uninteresting items rapidly with preserving high recommendation accuracy. Our experimental results show that our method is faster than the existing zero-injection method and also show that the recommendation accuracy using our method is slightly higher than or similar to that of the existing zero-injection method.