ACM Home Page
Please provide us with feedback. Feedback
A novel method for the evaluation of Boolean query effectiveness across a wide operational range
Full text PdfPdf (797 KB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Athens, Greece
Pages: 25 - 32  
Year of Publication: 2000
ISBN:1-58113-226-3
Author
Eero Sormunen  Department of Information Studies, University of Tampere, P.O. Box 607, FIN 33101 Tampere, Finland
Sponsors
Athens U of Econ & Business : Athens University of Economics and Business
Greek Com Soc : Greek Computer Society
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/345508.345541
What is a DOI?

ABSTRACT

Traditional methods for the system-oriented evaluation of Boolean IR system suffer from validity and reliability problems. Laboratory-based research neglects the searcher and studies suboptimal queries. Research on operational systems fails to make a distinction between searcher performance and system performance. This approach is neither capable of measuring performance at standard points of operation (e.g. across R0.0-R1.0).

A new laboratory-based evaluation method for Boolean IR systems is proposed. It is based on a controlled formulation of inclusive query plans, on an automatic conversion of query plans into elementary queries, and on combining elementary queries into optimal queries at standard points of operation. Major results of a large case experiment are reported. The validity, reliability, and efficiency of the method are considered in the light of empirical and analytical test data.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Arnold, B.H. (1962). Logic and Boolean algebra. Eaglewood Cliffs: Prentice-Hall.
 
2
3
 
4
Chvtal, V. (1983). Linear Programming. New York: W.H. Freeman.
 
5
Cleverdon, C.W. (1967). The Cranfield tests on index language devices. Aslib Proceedings 19(6), 173-193.
 
6
Fidel, R. (1991). Searcher's Selection of Search Keys. Journal of the American Society for Information Science 42(7), 490-500, 501-514, 515-527.
 
7
 
8
Harman, D. (1993). The First Text Retrieval Conference (TREC-1). Gaithersburg: National Institute of Standards and Technology. (NIST Spec. Publ. 500-207).
 
9
 
10
Harter, S.P. (1990). Search Term Combinations and Retrieval Overlap: A Proposed Methodology and Case Study. Journal of the American Society for Information Science 41(2), 132-146.
 
11
 
12
 
13
Ingwersen, P. & Willett, P. (1995). An Introduction to Algorithmic and Cognitive Approaches for Information Retrieval. Libri 450, 160-177.
14
 
15
Lancaster, F.W. (1968). Information Retrieval Systems: Characteristics, Testing, and Evaluation. New York: John Wiley.
 
16
 
17
 
18
McKinin, E.J., Sievert, M.E., et al. (1991). The Medline Full-Text Project. Journal of the American Society for Information Science 42(4), 297-307.
 
19
Newell, A. (1968). Heuristic programming: Ill-structured problems. In: Arofonsky, J. (Ed.). Progress in Operations Research, Vol III, 360-414. New York.
 
20
 
21
Salton, G. (1972). A new comparison between conventional indexing (MEDLARS) and automatic text processing (SMART). Journal of the American Society for Information Science 23(March-April), 75-84.
22
 
23
24
 
25
Saracevic, T., Kantor. P. et al. (1988). A Study of Information Seeking and Retrieving. Journal of the American Society for Information Science 39(3), pp. 161- 176, 177-196, and 197-216.
 
26
Sormunen, E. (2000). A Method for measuring Wide Range Performance of Boolean Queries in Full-Text Databases. Doctoral Thesis. Tampere: University of Tampere. Acta Electronica Universitatis Tamperensis, ISBN: 951-44-4732-8, 231 p. URL: http://granum.uta.fi/pdf/951-44-4732-8.pdf.
 
27
Sormunen, E., Laaksonen, J., et al. (1998). The IR Game - A Tool for Rapid Query Analysis in Cross-Language IR Experiments. PRICAI '98 Workshop on Cross Language Issues in Artificial Intelligence. Singapore, Nov 22-24, 1998, p. 22-32.
 
28
 
29
 
30