New methods for results merging in distributed information retrieval

Wu, S. and Crestani, F. and Gibb, F.; Callan, J. and Crestani, F. and Sanderson, M., eds. (2004) New methods for results merging in distributed information retrieval. In: Proceedings of the ACM SIGIR 2003 Workshop on Distributed Information retrieval. Lecture Notes in Computer Science, 2924 . Springer, pp. 84-100. ISBN 978-3-540-20875-4

Full text not available in this repository.Request a copy

Abstract

In distributed information retrieval systems, document overlaps occur frequently across results from different resources. This is especially the case for meta-search engines which merge results from several web search engines. This paper addresses the problem of merging results exploiting overlaps in order to achieve better performance. New algorithms for merging results are proposed, which take advantage of the use of duplicate documents in two ways: one correlates scores from different results; the other regards duplicates as increasing evidence of being relevant to the given query. An extensive experimentation has demonstrated that these methods are effective.

CORE (COnnecting REpositories)