Large-Scale Parallel Collaborative Filtering for the Netflix Prize (2008)
| Venue: | Proc. 4th Int’l Conf. Algorithmic Aspects in Information and Management, LNCS 5034 |
| Citations: | 12 - 0 self |
BibTeX
@INPROCEEDINGS{Zhou08large-scaleparallel,
author = {Yunhong Zhou and Dennis Wilkinson and Robert Schreiber and Rong Pan},
title = {Large-Scale Parallel Collaborative Filtering for the Netflix Prize},
booktitle = {Proc. 4th Int’l Conf. Algorithmic Aspects in Information and Management, LNCS 5034},
year = {2008},
pages = {337--348},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Many recommendation systems suggest items to users by utilizing the techniques of collaborative filtering (CF) based on historical records of items that the users have viewed, purchased, or rated. Two major problems that most CF approaches have to resolve are scalability and sparseness of the user profiles. In this paper, we describe Alternating-Least-Squares with Weighted-λ-Regularization (ALS-WR), a parallel algorithm that we designed for the Netflix Prize, a large-scale collaborative filtering challenge. We use parallel Matlab on a Linux cluster as the experimental platform. We show empirically that the performance of ALS-WR monotonically increases with both the number of features and the number of ALS iterations. Our ALS-WR applied to the Netflix dataset with 1000 hidden features obtained a RMSE score of 0.8985, which is one of the best results based on a pure method. Combined with the parallel version of other known methods, we achieved a performance improvement of 5.91 % over Netflix’s own CineMatch recommendation system. Our method is simple and scales well to very large datasets. 1
