Abstract
In distributed information retrieval systems, document overlaps occur frequently across results from different databases. This is especially the case for meta-search engines which merge results from several general-purpose web search engines. This paper addresses the problem of merging results which contain overlaps in order to achieve better performance. Several 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. A variety of experiments have demonstrated that these methods are effective.
Original language | English |
---|---|
Pages | 1067-1072 |
Number of pages | 5 |
DOIs | |
Publication status | Published - 17 Mar 2004 |
Event | Proceedings of ACM SAC 2004 - Nicosia, Cyprus Duration: 14 Mar 2004 → 17 Mar 2004 |
Conference
Conference | Proceedings of ACM SAC 2004 |
---|---|
City | Nicosia, Cyprus |
Period | 14/03/04 → 17/03/04 |
Keywords
- merging results
- algorithms
- meta-search engines
- information retrieval