PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Tonellotto N., Ounis I., Macdonald C. On upper bounds for dynamic pruning. In: ICTIR 2011 - Advances in Information Retrieval Theory. Third International Conference (Bertinoro, Italy, 12-14 September 2011). Proceedings, pp. 313 - 317. (Lecture Notes in Computer Science, vol. 6931). Springer, 2011.
 
 
Abstract
(English)
Dynamic pruning strategies enhance the efficiency of search engines, by making use of term upper bounds to decide when a document will not make the final set of k retrieved documents. After discussing different approaches for obtaining term upper bounds, we propose the use of multiple least upper bounds. Experiments are conducted on the TREC ClueWeb09 corpus, to measure the accuracy of different upper bounds.
URL: http://www.springerlink.com/content/n204526n572589w9/
DOI: 10.1007/978-3-642-23318-0_29
Subject Information Retrieval
H.3.3 Information Search and Retrieval


Icona documento 1) Download Document PDF
Icona documento 2) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional