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 language | English |
|---|---|
| Title of host publication | Proceedings of the ACM SIGIR 2003 Workshop on Distributed Information retrieval |
| Publisher | Springer |
| Pages | 84-100 |
| Number of pages | 16 |
| Volume | 2924 |
| ISBN (Print) | 978-3-540-20875-4 |
| Publication status | Published - 2004 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
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.