ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Learning to recommend with social trust ensemble
Full text PdfPdf (895 KB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval table of contents
Boston, MA, USA
SESSION: Recommenders I table of contents
Pages: 203-210  
Year of Publication: 2009
ISBN:978-1-60558-483-6
Authors
Hao Ma  The Chinese University of Hong Kong, Shatin, N.T., Hong Kong
Irwin King  The Chinese University of Hong Kong, Shatin, N.T., Hong Kong
Michael R. Lyu  The Chinese University of Hong Kong, Shatin, N.T., Hong Kong
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 76,   Downloads (12 Months): 387,   Citation Count: 4
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/1571941.1571978
What is a DOI?

ABSTRACT

As an indispensable technique in the field of Information Filtering, Recommender System has been well studied and developed both in academia and in industry recently. However, most of current recommender systems suffer the following problems: (1) The large-scale and sparse data of the user-item matrix seriously affect the recommendation quality. As a result, most of the recommender systems cannot easily deal with users who have made very few ratings. (2) The traditional recommender systems assume that all the users are independent and identically distributed; this assumption ignores the connections among users, which is not consistent with the real world recommendations. Aiming at modeling recommender systems more accurately and realistically, we propose a novel probabilistic factor analysis framework, which naturally fuses the users' tastes and their trusted friends' favors together. In this framework, we coin the term Social Trust Ensemble to represent the formulation of the social trust restrictions on the recommender systems. The complexity analysis indicates that our approach can be applied to very large datasets since it scales linearly with the number of observations, while the experimental results show that our method performs better than the state-of-the-art approaches.


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
P. Bedi, H. Kaur, and S. Marwaha. Trust based recommender system for semantic web. In Proc. of IJCAI '07, pages 2677--2682, 2007.
 
3
J.S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proc. of UAI '98, 1998.
4
5
6
7
8
9
 
10
11
12
13
 
14
P. Massa and P. Avesani. Trust-aware collaborative filtering for recommender systems. In Proc. of CoopIS/DOA/ODBASE, pages 492--508, 2004.
15
16
17
18
 
19
R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In Advances in Neural Information Processing Systems, volume 20, 2008.
20
 
21
L. Si and R. Jin. Flexible mixture model for collaborative filtering. In Proc. of ICML '03, 2003.
 
22
N. Srebro and T. Jaakkola. Weighted low-rank approximations. In Proc. of ICML '03, 2003.
23
24


Collaborative Colleagues:
Hao Ma: colleagues
Irwin King: colleagues
Michael R. Lyu: colleagues