A threshold rule applied to the retrieval decision model
Author:
- 1 March 1978
- journal article
- research article
- Published by Wiley in Journal of the American Society for Information Science
- Vol. 29 (2) , 77-80
Abstract
The retrieval decision problem is considered from the viewpoint of a decision theory approach. A threshold rule based on a suggested rule for indexing is considered and analyzed for retrieval decisions. The threshold rule is seen as a good descriptive measure of what a reasonable retrieval system should be able to accomplish. A retrieval mechanism of randomly drawing documents is analyzed to determine the relative strength of the threshold rule. The Neyman‐Pearson lemma is shown to yield a better a priori decision rule for retrieval; maximize precision subject to a fixed level of recall, instead of setting a lower limit upon precision, as does the threshold rule. The threshold rule is seen as a necessary, but not sufficient, condition for effective retrieval. A sufficient condition for the threshold rule illustrates the relationship between it and the rule derived from the Neyman‐Pearson lemma. Finally, a new measure of information retrieval system performance is presented, based on the threshold rule.Keywords
This publication has 4 references indexed in Scilit:
- Evaluation of information retrieval systems: A decision theory approachJournal of the American Society for Information Science, 1978
- Retrieval performance and information theoryInformation Processing & Management, 1977
- On indexing, retrieval and the meaning of aboutJournal of the American Society for Information Science, 1977
- Expected search length: A single measure of retrieval effectiveness based on the weak ordering action of retrieval systemsAmerican Documentation, 1968