ACM Home Page
Please provide us with feedback. Feedback
Collaborative filtering with privacy via factor analysis
Full text PdfPdf (169 KB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Tampere, Finland
SESSION: Collaborative Filtering table of contents
Pages: 238 - 245  
Year of Publication: 2002
ISBN:1-58113-561-0
Author
John Canny  University of California, Berkeley, CA
Sponsor
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 33,   Downloads (12 Months): 134,   Citation Count: 44
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/564376.564419
What is a DOI?

ABSTRACT

Collaborative filtering (CF) is valuable in e-commerce, and for direct recommendations for music, movies, news etc. But today's systems have several disadvantages, including privacy risks. As we move toward ubiquitous computing, there is a great potential for individuals to share all kinds of information about places and things to do, see and buy, but the privacy risks are severe. In this paper we describe a new method for collaborative filtering which protects the privacy of individual data. The method is based on a probabilistic factor analysis model. Privacy protection is provided by a peer-to-peer protocol which is described elsewhere, but outlined in this paper. The factor analysis approach handles missing data without requiring default values for them. We give several experiments that suggest that this is most accurate method for CF to date. The new algorithm has other advantages in speed and storage over previous algorithms. Finally, we suggest applications of the approach to other kinds of statistical analyses of survey or questionaire data.


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
Breese, Heckermen, and Kadie. Empirical analysis of predictive algorithms for collaborative filtering. Technical report, Microsoft Research, October 1998.
 
3
 
4
J. Canny. Some techniques for privacy in ubicomp and context-aware applications. In UBICOMP-2002, Goteborg, Sweden, Sept. 2002. (submitted).
 
5
M. Claypool, A. Gokhale, T. Miranda, P. Murnikov, D. Netes, and M. Sartin. Combining content-based and collaborative filters in an online newspaper. In ACM SIGIR WS on Recommender Systems, 1999.
 
6
A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 39(1):1--38, 1977.
 
7
J. DeTreville, 2002. personal communication.
 
8
B. Frey. Turbo factor analysis. Adv. Neural Information Processing, 1999. (submitted).
 
9
10
 
11
12
 
13
O. P. John. The "big five" factor taxonomy: Dimensions of personality in the natural language and in questionnaires. In L. A. Pervin, editor, Handbook of personality: Theory and research. Guilford, NY, 1990.
 
14
M. Jordan and C. Bishop. An Introduction to Graphical Models. MIT Press, 2002. In press.
15
 
16
D. Pennock and E. Horvitz. Collaborative filtering by personality diagnosis: A hybrid memory- and model-based approach. In IJCAI Workshop on Machine Learning for Information Filtering, Stockholm, Sweden, August 1999.
 
17
 
18
E. M. Rogers. Diffusion of Innovations, Fourth Edition. The Free Press, 1995.
 
19
B. M. Sarwar, G. Karypis, J. A. Konstan, and J. Riedl. Application of dimensionality reduction in recommender system -- a case study. In ACM WebKDD 2000 Web Mining for E-Commerce Workshop, 2000. Full length paper.

CITED BY  44