2011
Conference article
Restricted
On upper bounds for dynamic pruning
Tonellotto Nicola, Ounis Iadh, Macdonald Craig
Information Retrieval
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.
Source: Advances in Information Retrieval Theory. Third International Conference, ICTIR 2011, pp. 313–317, Bertinoro, Italy, 12-14 September 2011
Metrics
Back to previous page
BibTeX entry
@inproceedings{oai:it.cnr:prodotti:206220,
title = {On upper bounds for dynamic pruning},
author = {Tonellotto Nicola and Ounis Iadh and Macdonald Craig},
doi = {10.1007/978-3-642-23318-0_29},
booktitle = {Advances in Information Retrieval Theory. Third International Conference, ICTIR 2011, pp. 313–317, Bertinoro, Italy, 12-14 September 2011},
year = {2011}
}CNR authorsLaboratories
0000-0002-7427-1001CNR ExploRA
DOIAlso available from
DOIAlso available from
