New methods for results merging in distributed information retrieval

S. Wu, F. Crestani, F. Gibb, J. Callan (Editor), F. Crestani (Editor), M. Sanderson (Editor)

Research output: Chapter in Book/Report/Conference proceedingChapter

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.
Original languageEnglish
Title of host publicationProceedings of the ACM SIGIR 2003 Workshop on Distributed Information retrieval
PublisherSpringer
Pages84-100
Number of pages16
Volume2924
ISBN (Print)978-3-540-20875-4
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

    Fingerprint

Keywords

  • information retrieval
  • search engines
  • search relevance

Cite this

Wu, S., Crestani, F., Gibb, F., Callan, J. (Ed.), Crestani, F. (Ed.), & Sanderson, M. (Ed.) (2004). New methods for results merging in distributed information retrieval. In Proceedings of the ACM SIGIR 2003 Workshop on Distributed Information retrieval (Vol. 2924, pp. 84-100). (Lecture Notes in Computer Science). Springer.