ACM Home Page
Please provide us with feedback. Feedback
Collaborative filtering via gaussian probabilistic latent semantic analysis
Full text PdfPdf (208 KB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval table of contents
Toronto, Canada
SESSION: Filtering and retrieval models table of contents
Pages: 259 - 266  
Year of Publication: 2003
ISBN:1-58113-646-3
Author
Thomas Hofmann  Brown University, Providence, RI
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 136,   Citation Count: 15
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/860435.860483
What is a DOI?

ABSTRACT

Collaborative filtering aims at learning predictive models of user preferences, interests or behavior from community data, i.e. a database of available user preferences. In this paper, we describe a new model-based algorithm designed for this task, which is based on a generalization of probabilistic latent semantic analysis to continuous-valued response variables. More specifically, we assume that the observed user ratings can be modeled as a mixture of user communities or interest groups, where users may participate probabilistically in one or more groups. Each community is characterized by a Gaussian distribution on the normalized ratings for each item. The normalization of ratings is performed in a user-specific manner to account for variations in absolute shift and variance of ratings. Experiments on the EachMovie data set show that the proposed approach compares favorably with other collaborative filtering techniques.


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
3
 
4
 
5
J. S. Breese, D. Heckerman, and C. Kardie. Empirical analysis of predictive algorithms for collaborative filtering.In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence pages 43--52, 1998.
 
6
L. Ungar and D. Foster. Clustering methods for collaborative filtering. In Proceedings of the Workshop on Recommendation Systems AAAI Press, 1998.
 
7
C. Basu, H. Hirsh, and W. Cohen. Recommendation as classification: Using social and content-based information in recommendation. In Recommender System Workshop pages 11--15,1998.
 
8
Y.-H. Chien and E. I. George. A Bayesian model for collaborative filtering. In Online Proceedings of The Seventh International Workshop on Artificial Intelligence and Statistics, 1999.
 
9
 
10
11
 
12
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.
 
13
 
14
15
 
16

CITED BY  17