Inverted file search algorithms for collaborative filtering

Cöster, Rickard and Svensson, Martin (2002) Inverted file search algorithms for collaborative filtering. In: Proceedings of the 25th annual international conference on Research and development in information retrieval (SIGIR 2002), Tampere, Finland.

Full text not available from this repository.


This paper explores the possibility of using a disk based inverted file structure for collaborative filtering. Our hypothesis is that this allows for faster calculation of predictions and also that early termination heuristics may be used to further speed up the filtering process and perhaps even improve the quality of the predictions. In an experiment on the EachMovie dataset this was tested. Our results indicate that searching the inverted file structure is many times faster than general in-memory vector search, even for very large profiles. The Continue termination heuristics produces the best ranked predictions in our experiments, and Quit is the top performer in terms of speed.

Item Type:Conference or Workshop Item (Paper)
Subjects:H. Information Systems > H.3 INFORMATION STORAGE AND RETRIEVAL
ID Code:38
Deposited By:Userware Researcher
Deposited On:24 Oct 2005
Last Modified:18 Nov 2009 15:51

Repository Staff Only: item control page