A slope one collaborative filtering recommendation algorithm using uncertain neighbors optimizing

Authors:
Jingjiao Li;Limei Sun;Jiao Wang
Affiliations:
College of Information Science and Engineering, Northeastern University, Shenyang, China;College of Information Science and Engineering, Northeastern University, Shenyang, China and Information and Control Engineering Faculty, Shenyang Jianzhu University, Shenyang, China;College of Information Science and Engineering, Northeastern University, Shenyang, China
Venue:
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
Year:
2011

Citing 7
Cited 0

Item-based collaborative filtering recommendation algorithms

Proceedings of the 10th international conference on World Wide Web
An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms

Information Retrieval
Unifying user-based and item-based collaborative filtering approaches by similarity fusion

SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Effective missing data prediction for collaborative filtering

SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
A random walk method for alleviating the sparsity problem in collaborative filtering

Proceedings of the 2008 ACM conference on Recommender systems
A hybrid content-based and item-based collaborative filtering approach to recommend TV programs enhanced with singular value decomposition

Information Sciences: an International Journal
A hybrid recommendation method with reduced data for large-scale application

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews

Quantified Score

Hi-index	0.00

Visualization

Abstract

Collaborative filtering is one of widely-used techniques in recommendation systems. Data sparsity is a main factor which affects the prediction accuracy of collaborative filtering. Slope One algorithm uses simple linear regression model to solve data sparisity problem. Combined with users' similarities, k-nearest-neighborhood method can optimize the quality of ratings made by users participating in prediction. Based on Slope One algorithm, a new collaborative filtering algorithm combining uncertain neighbors with Slope One is presented. Firstly, different numbers of neighbors for each user are dynamically selected according to the similarities with other users. Secondly, average deviations between pairs of relevant items are generated on the basis of ratings from neighbor users. At last, the object ratings are predicted by linear regression model. Experiments on the MovieLens dataset show that the proposed algorithm gives better recommendation quality and is more robust to data sparsity than Slope One. It also outperforms some other collaborative filtering algorithms on prediction accuracy.