Collaborative Filtering (CF) is currently one of the most popular and most widely used personalization techniques. It generates personalized predictions based on the assumption that users with similar tastes prefer similar items. One of the major drawbacks of the CF from the computational point of view is its limited scalability since the computational effort required by the CF grows linearly both with the number of available users and items. This work proposes a novel efficient variant of the CF employed over a multidimensional content-addressable space. The proposed approach heuristically decreases the computational effort required by the CF algorithm by limiting the search process only to potentially similar users. Experimental results demonstrate that the proposed heuristic approach is capable of generating predictions with high levels of accuracy, while significantly improving the performance in comparison with the traditional implementations of the CF.
|Number of pages||25|
|Journal||International Journal of Pattern Recognition and Artificial Intelligence|
|State||Published - Mar 2007|
Bibliographical noteFunding Information:
The authors gratefully acknowledge the support of the Caesarea Edmond Benjamin de Rothschild Foundation Institute for Interdisciplinary Applications of Computer Science (CRI) and the Haifa Interdisciplinary Research Center for Advanced Computer Science (HIACS), both at the University of Haifa.
- Collaborative filtering
- Content-addressable systems
- K-nearest neighbors search
- Recommender systems
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
- Artificial Intelligence