Collaborative filtering based on content addressing

Shlomo Berkovsky*, Yaniv Eytani, Larry Manevitz

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

Abstract

Collaborative Filtering (CF) is one of the most popular recommendation techniques. It is based on the assumption that users with similar tastes prefer similar items. One of the major drawbacks of the CF is its limited scalability, as the complexity of the CF grows linearly both with the number of available users and items. This work proposes a new fast variant of the CF employed over multi-dimensional content-addressable space. Our 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 our approach is capable of generate recommendations with high levels of accuracy, while significantly improving performance in comparison with the traditional implementation of the CF.

Original languageEnglish
Title of host publicationICEIS 2006 - 8th International Conference on Enterprise Information Systems, Proceedings
Pages91-98
Number of pages8
VolumeAIDSS
Publication statusPublished - 1 Dec 2006
Externally publishedYes
Event8th International Conference on Enterprise Information Systems, ICEIS 2006 - Paphos, Cyprus
Duration: 23 May 200627 May 2006

Conference

Conference8th International Conference on Enterprise Information Systems, ICEIS 2006
CountryCyprus
CityPaphos
Period23/05/0627/05/06

Keywords

  • Collaborative filtering
  • Content-addressable systems
  • Recommender systems

Fingerprint

Dive into the research topics of 'Collaborative filtering based on content addressing'. Together they form a unique fingerprint.

Cite this