ACM Home Page
Please provide us with feedback. Feedback
Robust collaborative filtering
Full text PdfPdf (437 KB)
Source
ACM Conference On Recommender Systems archive
Proceedings of the 2007 ACM conference on Recommender systems table of contents
Minneapolis, MN, USA
SESSION: Algorithms: collaborative filtering table of contents
Pages: 49 - 56  
Year of Publication: 2007
ISBN:978-1-59593-730--8
Authors
Bhaskar Mehta  Universitat Hannover, Hannover, Germany
Thomas Hofmann  Google Inc., Zurich, Switzerland
Wolfgang Nejdl  Universitat Hannover, Hannover, Germany
Sponsors
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 49,   Downloads (12 Months): 420,   Citation Count: 3
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/1297231.1297240
What is a DOI?

ABSTRACT

The widespread deployment of recommender systems has lead to user feedback of varying quality. While some users faithfully express their true opinion, many provide noisy ratings which can be detrimental to the quality of the generated recommendations. The presence of noise can violate modeling assumptions and may thus lead to instabilities in estimation and prediction. Even worse, malicious users can deliberately insert attack profiles in an attempt to bias the recommender system to their benefit.

Robust statistics is an area within statistics where estimation methods have been developed that deteriorate more gracefully in the presence of unmodeled noise and slight departures from modeling assumptions. In this work, we study how such robust statistical methods, in particular M-estimators, can be used to generate stable recommendation even in the presence of noise and spam. To that extent, we present a Robust Matrix Factorization algorithm and study its stability. We conclude that M-estimators do not add significant stability to recommendation; however the presented algorithm can outperform existing recommendation algorithms in its recommendation quality.


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. Burke, B. Mobasher, C. Williams, and R. Bhaumik. Analysis and detection of segment-focused attacks against collaborative recommendation. 2006.
3
 
4
A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39(1):1-38, 1977.
 
5
K. Gabriel and S. Zamir. Lower Rank Approximation of Matrices by Least Squares with Any Choice of Weights. Technometrics, 21(4):489-498, 1979.
 
6
G. Gorrell. Generalized hebbian algorithm for incremental singular value decomposition in natural language processing. In EACL, 2006.
 
7
8
 
9
H. Hotelling. Analysis of a Complex of Statistical Variables Into Principal Components. 1933.
 
10
P. Huber. Robust Estimation of a Location Parameter. The Annals of Mathematical Statistics, 35(1):73--101, 1964.
 
11
P. Huber. Robust Statistics. Wiley-IEEE, 2004.
 
12
I. T. Jolliffe. Principal Component Analysis (2nd Edition). Springer, 2002.
13
 
14
 
15
L. Liu, D. Hawkins, S. Ghosh, and S. Young. Robust singular value decomposition analysis of microarray data. Proceedings of the National Academy of Sciences, 100(23):13167--13172, 2003.
 
16
B. Mehta. Unsupervised shilling detection for collaborative filtering. In AAAI 2007: Proceedings of the 22nd Twenty-Second Conference on Artificial Intelligence, AAAI Press, Vancouver, Canada, 2007.
17
 
18
B. Mobasher, R. Burke, C. Williams, and R. Bhaumik. Analysis and detection of segment-focused attacks against collaborative recommendation. 2006.
 
19
B. Mobasher, R. D. Burke, and J. J. Sandvig. Model-based collaborative filtering as a defense against profile injection attacks. In AAAI, 2006.
20
21
 
22
T. D. Sanger. Optimal Unsupervised Learning in a single-layer linear feedforward neural network. Neural Networks, 2(6):459--473, 1989.
 
23
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Application of dimensionality reduction in recommender systems - a case study. Defense Technical Information Center, 2000.
 
24
B. Webb. Netflix update: Try this at home. http://sifter.org/~simon/journal/20061211.html, 2006.
 
25
C. Williams, B. Mobasher, R. Burke, J. Sandvig, and R. Bhaumik. Detection of Obfuscated Attacks in Collaborative Recommender Systems. In Workshop on Recommender Systems, ECAI, 2006.
 
26


Collaborative Colleagues:
Bhaskar Mehta: colleagues
Thomas Hofmann: colleagues
Wolfgang Nejdl: colleagues