Algorithms for within-cluster searches using inverted files

View/ Open
Author
Altingovde, I. S.
Can, F.
Ulusoy, Ö.
Date
2006Journal Title
Lecture Notes in Computer Science
Print ISSN
0302-9743
Publisher
Springer
Volume
4263
Pages
707 - 716
Language
English
Type
Conference Paper
Metadata
Show full item recordPlease cite this item using this persistent URL
http://hdl.handle.net/11693/27269Abstract
Information retrieval over clustered document collections has two successive stages: first identifying the best-clusters and then the best-documents in these clusters that are most similar to the user query. In this paper, we assume that an inverted file over the entire document collection is used for the latter stage. We propose and evaluate algorithms for within-cluster searches, i.e., to integrate the best-clusters with the best-documents to obtain the final output including the highest ranked documents only from the best-clusters. Our experiments on a TREC collection including 210,158 documents with several query sets show that an appropriately selected integration algorithm based on the query length and system resources can significantly improve the query evaluation efficiency. © Springer-Verlag Berlin Heidelberg 2006.