Tonellotto, N., Macdonald, C., and Ounis, I. (2013) Efficient and effective retrieval using selective pruning. In: 6th ACM International Conference on Web Search and Data Mining, Rome, Italy, 6-8 February, 2013, (doi:10.1145/2433396.2433407)
Full text not currently available from Enlighten.
Publisher's URL: http://dx.doi.org/10.1145/2433396.2433407
Retrieval can be made more efficient by deploying dynamic pruning strategies such as WAND, which do not degrade effectiveness up to a given rank. It is possible to increase the efficiency of such techniques by pruning more 'aggressively'. However, this may reduce effectiveness. In this work, we propose a novel selective framework that determines the appropriate amount of pruning aggressiveness on a per-query basis, thereby increasing overall efficiency without significantly reducing overall effectiveness. We postulate two hypotheses about the queries that should be pruned more aggressively, which generate two approaches within our framework, based on query performance predictors and query efficiency predictors, respectively. We thoroughly experiment to ascertain the efficiency and effectiveness impacts of the proposed approaches, as part of a search engine deploying state-of-the-art learning to rank techniques. Our results on 50 million documents of the TREC ClueWeb09 collection show that by using query efficiency predictors to target inefficient queries, we observe that a 36% reduction in mean response time and a 50% reduction of the response times experienced by the slowest 10% of queries can be achieved while still ensuring effectiveness.
|Item Type:||Conference Proceedings|
|Glasgow Author(s) Enlighten ID:||Macdonald, Dr Craig and Ounis, Dr Iadh|
|Authors:||Tonellotto, N., Macdonald, C., and Ounis, I.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|College/School:||College of Science and Engineering > School of Computing Science|
Enlighten Editors: Update this record