1532-2890/asset/olbannerleft.gif?v=1&s=d833098325c9f1060bcbee51adf276c155608167)
1532-2890/asset/olbannercenter.gif?v=1&s=661179918edb4fa732edfd3408eb050a6ce87809)
1532-2890/asset/olbannerright.gif?v=1&s=1ef8a363944134c502cbffa1937878a71b4cc635)
Research
Employing the resolution power of search keys
Article first published online: 19 MAR 2001
DOI: 10.1002/asi.1106
Copyright © 2001 John Wiley & Sons, Inc.
Issue
1532-2890/asset/cover.gif?v=1&s=c9d33fcfc2cef6291d3cfd7d7be1de8ca023f1c7 "Journal of the American Society for Information Science and Technology")
Journal of the American Society for Information Science and Technology
Volume 52, Issue 7, pages 575–583, 2001
Additional Information
How to Cite
Pirkola, A. and Järvelin, K. (2001), Employing the resolution power of search keys. Journal of the American Society for Information Science and Technology, 52: 575–583. doi: 10.1002/asi.1106
Publication History
- Issue published online: 26 APR 2001
- Article first published online: 19 MAR 2001
- Manuscript Accepted: 11 JAN 2001
- Manuscript Revised: 1 JAN 2001
- Manuscript Received: 3 JUL 2000
- Abstract
- Article
- References
- Cited By
Abstract
Search key resolution power is analyzed in the context of a request, i.e., among the set of search keys for the request. Methods of characterizing the resolution power of keys automatically are studied, and the effects search keys of varying resolution power have on retrieval effectiveness are analyzed. It is shown that it often is possible to identify the best key of a query while the discrimination between the remaining keys presents problems. It is also shown that query performance is improved by suitably using the best key in a structured query. The tests were run with InQuery1 in a subcollection of the TREC collection, which contained some 515,000 documents.