ACM Home Page
Please provide us with feedback. Feedback
SVD-based collaborative filtering with privacy
Full text PdfPdf (154 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2005 ACM symposium on Applied computing table of contents
Santa Fe, New Mexico
SESSION: Electronic commerce technologies (ECT) table of contents
Pages: 791 - 795  
Year of Publication: 2005
ISBN:1-58113-964-0
Authors
Huseyin Polat  Syracuse University, NY
Wenliang Du  Syracuse University, NY
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 72,   Citation Count: 7
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/1066677.1066860
What is a DOI?

ABSTRACT

Collaborative filtering (CF) techniques are becoming increasingly popular with the evolution of the Internet. Such techniques recommend products to customers using similar users' preference data. The performance of CF systems degrades with increasing number of customers and products. To reduce the dimensionality of filtering databases and to improve the performance, Singular Value Decomposition (SVD) is applied for CF. Although filtering systems are widely used by E-commerce sites, they fail to protect users' privacy. Since many users might decide to give false information because of privacy concerns, collecting high quality data from customers is not an easy task. CF systems using these data might produce inaccurate recommendations. In this paper, we discuss SVD-based CF with privacy. To protect users' privacy while still providing recommendations with decent accuracy, we propose a randomized perturbation-based scheme.


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
Anonymizer.com: http://www.anonymizer.com.
2
3
 
4
D. Billsus and M. J. Pazzani. Learning collaborative information fiters. In Proceedings of the 1998 Workshop on Recommender Systems, August 1998.
 
5
J. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pages 43--52, Madison, WI, July 1998.
 
6
7
 
8
L. F. Cranor, J. Reagle, and M. S. Ackerman. Beyond concern: Understanding net users' attitudes about online privacy. Technical report, AT&T Labs-Research, April 1999. Available from http://www.research.att.com /library/trs/TRs/99/99.4.3/report.htm.
9
10
 
11
12
 
13
B. M. Sarwar, G. Karypis, J. A. Konstan, and J. T. Riedl. Application of dimensionality reduction in recommender system-a case study. In ACM WebKDD 2000 Web Mining for E-commerce Workshop, 2000.
 
14
A. F. Westin. Freebies and privacy. Technical report, Opinion Research Corporation, July 1999. Availabe from http://www.privacyexchange.org/iss/surveys/sr990714.html.

CITED BY  7
 
 
 

Collaborative Colleagues:
Huseyin Polat: colleagues
Wenliang Du: colleagues