Link prediction approach to collaborative filtering
- 7 June 2005
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 141-142
- https://doi.org/10.1145/1065385.1065415
Abstract
Recommender systems can provide valuable services in a digital library environment, as demonstrated by its commercial success in book, movie, and music industries. One of the most commonly-used and successful recommendation algorithms is collaborative filtering, which explores the correlations within user-item interactions to infer user interests and preferences. However, the recommendation quality of collaborative filtering approaches is greatly limited by the data sparsity problem. To alleviate this problem we have previously proposed graph-based algorithms to explore transitive user-item associations. In this paper, we extend the idea of analyzing user-item interactions as graphs and employ link prediction approaches proposed in the recent network modeling literature for making collaborative filtering recommendations. We have adapted a wide range of linkage measures for making recommendations. Our preliminary experimental results based on a book recommendation dataset show that some of these measures achieved significantly better performance than standard collaborative filtering algorithms.Keywords
This publication has 5 references indexed in Scilit:
- Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filteringACM Transactions on Information Systems, 2004
- The link prediction problem for social networksPublished by Association for Computing Machinery (ACM) ,2003
- Friends and neighbors on the WebSocial Networks, 2003
- Assessing experimentally derived interactions in a small worldProceedings of the National Academy of Sciences of the United States of America, 2003
- A new status index derived from sociometric analysisPsychometrika, 1953