Learning to merge search results for efficient Distributed Information Retrieval

Share/Save/Bookmark

Tjin-Kam-Jet, Kien-Tsoi T.E. and Hiemstra, Djoerd (2010) Learning to merge search results for efficient Distributed Information Retrieval. In: 10th Dutch-Belgian Information Retrieval Workshop, 25 Jan 2010, Nijmegen, the Netherlands (pp. pp. 55-62). (In Press)

open access
[img]
Preview
PDF
290kB
Abstract:Merging search results from different servers is a major problem in Distributed Information Retrieval. We used Regression-SVM and Ranking-SVM which would learn a function that merges results based on information that is readily available: i.e. the ranks, titles, summaries and URLs contained in the results pages. By not downloading additional information, such as the full document, we decrease bandwidth usage. CORI and Round Robin merging were used as our baselines; surprisingly, our results show that the SVM-methods do not improve over those baselines.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/70344
Publisher URL:http://www.ru.nl/ds/ifl/dir_2010/proceedings/
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page