Soft evaluation of Boolean search queries in information retrieval systems
Information Technology Research Development Applications
Aspects of the P-Norm model of information retrieval: syntactic query generation, efficiency, and theoretical properties
Properties of extended Boolean models in information retrieval
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
Boolean search: current state and perspectives
Journal of the American Society for Information Science - Special topic issue: youth issues in information science
Extended Boolean information retrieval
Communications of the ACM
Analyzing the Effectiveness of Extended Boolean Models in Information Retrieval
Analyzing the Effectiveness of Extended Boolean Models in Information Retrieval
Discovering key concepts in verbose queries
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Rank-biased precision for measurement of retrieval effectiveness
ACM Transactions on Information Systems (TOIS)
The challenge of high recall in biomedical systematic search
Proceedings of the third international workshop on Data and text mining in bioinformatics
Protocol-driven searches for medical and health-sciences systematic reviews
ICTIR'11 Proceedings of the Third international conference on Advances in information retrieval theory
Hi-index | 0.00 |
Searching for relevant documents is a laborious task involved in preparing systematic reviews of biomedical literature. Currently, complex Boolean queries are iteratively developed, and then each document of the final query result is assessed for relevance. However, the result set sizes of these queries are hard to control, and in practice it is difficult to balance the competing desires to keep result sets to a manageable volume, and yet not exclude relevant documents from consideration. Ranking overcomes these problems by allowing the user to choose the number of documents to be inspected. However, previous work did not show significant improvements over the Boolean approach when ranked keyword queries based on terms in the Boolean queries, review title, research question or inclusion criteria were used. The extended Boolean retrieval model also provides ranked output, but existing complex Boolean queries can be directly used as formal description of the complex information needs occurring in this domain. In this paper we show that extended Boolean retrieval is able to find a larger quantity of relevant documents than previous approaches when comparable (or greater) numbers of documents are inspected for relevance.