ACM Home Page
Please provide us with feedback. Feedback
Effective missing data prediction for collaborative filtering
Full text PdfPdf (240 KB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Amsterdam, The Netherlands
SESSION: Routing and filtering table of contents
Pages: 39 - 46  
Year of Publication: 2007
ISBN:978-1-59593-597-7
Authors
Hao Ma  The Chinese University of Hong Kong
Irwin King  The Chinese University of Hong Kong
Michael R. Lyu  The Chinese University of Hong Kong
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 41,   Downloads (12 Months): 236,   Citation Count: 6
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/1277741.1277751
What is a DOI?

ABSTRACT

Memory-based collaborative filtering algorithms have been widely adopted in many popular recommender systems, although these approaches all suffer from data sparsity and poor prediction quality problems. Usually, the user-item matrix is quite sparse, which directly leads to inaccurate recommendations. This paper focuses the memory-based collaborative filtering problems on two crucial factors: (1) similarity computation between users or items and (2) missing data prediction algorithms. First, we use the enhanced Pearson Correlation Coefficient (PCC) algorithm by adding one parameter which overcomes the potential decrease of accuracy when computing the similarity of users or items. Second, we propose an effective missing data prediction algorithm, in which information of both users and items is taken into account. In this algorithm, we set the similarity threshold for users and items respectively, and the prediction algorithm will determine whether predicting the missing data or not. We also address how to predict the missing data by employing a combination of user and item information. Finally, empirical studies on dataset MovieLens have shown that our newly proposed method outperforms other state-of-the-art collaborative filtering algorithms and it is more robust against data sparsity.


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
J. S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proc. of UAI, 1998.
3
 
4
M. Claypool, A. Gokhale, T. Miranda, P. Murnikov, D. Netes, and M. Sartin. Combining content-based and collaborative filters in an online newspaper. In Proc. of SIGIR, 1999.
5
 
6
7
8
9
10
 
11
A. Kohrs and B. Merialdo. Clustering for collaborative filtering applications. In Proc. of CIMCA, 1999.
 
12
13
 
14
15
16
17
 
18
 
19
L. Si and R. Jin. Flexible mixture model for collaborative filtering. In Proc. of ICML, 2003.
 
20
L. H. Ungar and D. P. Foster. Clustering methods for collaborative filtering. In Proc. Workshop on Recommendation System at the 15th National Conf. on Artificial Intelligence, 1998.
21
22

CITED BY  6

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