Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
410408 | Neurocomputing | 2010 | 4 Pages |
Abstract
Collaborative filtering is one of the most successful and popular methods in developing recommendation systems. However, conventional collaborative filtering methods suffer from item sparsity and new item problems. In this paper, we propose a probabilistic learning approach that solves the item sparsity problem while describing users and items with domain concepts. Our method uses a probabilistic match with domain concepts, whereas conventional collaborative filtering uses an exact match to find similar users. Empirical experiments show that our method outperforms the conventional ones.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Jae-won Lee, Han-Joon Kim, Sang-goo Lee,