Abstract
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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Macdonald, C., Tonellotto, N., & Ounis, I. (2011). On upper bounds for dynamic pruning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6931 LNCS, pp. 313–317). https://doi.org/10.1007/978-3-642-23318-0_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
