title: Lazy collaborative filtering for data sets with missing values.
abstract: As one of the biggest challenges in research on recommender systems, the data sparsity issue is mainly caused by the fact that users tend to rate a small proportion of items from the huge number of available items. This issue becomes even more problematic for the neighborhood-based collaborative filtering (CF) methods, as there are even lower numbers of ratings available in the neighborhood of the query item. In this paper, we aim to address the data sparsity issue in the context of neighborhood-based CF. For a given query (user, item), a set of key ratings is first identified by taking the historical information of both the user and the item into account. Then, an auto-adaptive imputation (AutAI) method is proposed to impute the missing values in the set of key ratings. We present a theoretical analysis to show that the proposed imputation method effectively improves the performance of the conventional neighborhood-based CF methods. The experimental results show that our new method of CF with AutAI outperforms six existing recommendation methods in terms of accuracy.
authors.forename: Yongli
authors.initials: Y
authors.lastname: Ren
authors.forename: Gang
authors.initials: G
authors.lastname: Li
authors.forename: Jun
authors.initials: J
authors.lastname: Zhang
authors.forename: Wanlei
authors.initials: W
authors.lastname: Zhou
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D057225:Data Mining / Q000379:methods*; D016208:Databases, Factual; D016247:Information Storage and Retrieval / Q000379:methods*; D010363:Pattern Recognition, Automated / Q000379:methods*; D018401:Sample Size; D012815:Signal Processing, Computer-Assisted