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.
Original language | English (US) |
---|---|
Pages (from-to) | 141-142 |
Number of pages | 2 |
Journal | Proceedings of the ACM/IEEE Joint Conference on Digital Libraries |
DOIs | |
State | Published - 2005 |
Event | 5th ACM/IEEE Joint Conference on Digital Libraries - Digital Libraries: Cyberinfrastructure for Research and Education - Denver, CO, United States Duration: Jun 7 2005 → Jun 11 2005 |
Keywords
- Collaborative filtering
- Link prediction
- Recommender system
ASJC Scopus subject areas
- General Engineering