ACM Home Page
Please provide us with feedback. Feedback
Modeling relationships at multiple scales to improve accuracy of large recommender systems
Full text PdfPdf (866 KB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
San Jose, California, USA
SESSION: Research track papers table of contents
Pages: 95 - 104  
Year of Publication: 2007
ISBN:978-1-59593-609-7
Authors
Robert Bell  AT&T
Yehuda Koren  AT&T
Chris Volinsky  AT&T
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 31,   Downloads (12 Months): 340,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1281192.1281206
What is a DOI?

ABSTRACT

The collaborative filtering approach to recommender systems predicts user preferences for products or services by learning past user-item relationships. In this work, we propose novel algorithms for predicting user ratings of items by integrating complementary models that focus on patterns at different scales. At a local scale, we use a neighborhood-based technique that infers ratings from observed ratings by similar users or of similar items. Unlike previous local approaches, our method is based on a formal model that accounts for interactions within the neighborhood, leading to improved estimation quality. At a higher, regional, scale, we use SVD-like matrix factorization for recovering the major structural patterns in the user-item rating matrix. Unlike previous approaches that require imputations in order to fill in the unknown matrix entries, our new iterative algorithm avoids imputation. Because the models involve estimation of millions, or even billions, of parameters, shrinkage of estimated values to account for sampling variability proves crucial to prevent overfitting. Both the local and the regional approaches, and in particular their combination through a unifying model, compare favorably with other approaches and deliver substantially better results than the commercial Netflix Cinematch recommender system on a large publicly available data set.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
R. Bell and Y. Koren, "Improved Neighborhood-based Collaborative Filtering", submitted, 2007.
 
3
S. Deerwester, S. Dumais, G. W. Furnas, T. K. Landauer and R. Harshman, "Indexing by Latent Semantic Analysis", Journal of the Society for Information Science 41 (1990), 391--407.
4
 
5
 
6
G. H. GolubandC. F. VanLoan, Matrix Computations, Johns Hopkins University Press, 1996.
7
 
8
D. Kim and B. Yum, "Collaborative Filtering Based on Iterative Principal Component Analysis", Expert Systems with Applications 28 (2005), 823--830.
9
 
10
Netflix prize - www.netflixprize.com.
 
11
 
12
J. Nocedal and S. Wright, Numerical Optimization, Springer (1999).
 
13
 
14
B. M. Sarwar, G. Karypis, J. A. Konstan, and J. Riedl, "Application of Dimensionality Reduction in Recommender System - A Case Study", WEBKDD'2000.
15
 
16
R. Tibshirani, "Regression Shrinkage and Selection via the Lasso", Journal of the Royal Statistical Society B 58 (1996).
17

CITED BY  10

Collaborative Colleagues:
Robert Bell: colleagues
Yehuda Koren: colleagues
Chris Volinsky: colleagues