scispace - formally typeset
Search or ask a question

Showing papers on "Ranking (information retrieval) published in 1977"


Journal ArticleDOI
TL;DR: The study found that relevant documents were ranked significantly higher than nonrelevant documents in the set of documents retrieved in response to a Boolean query.
Abstract: This study examined the effectiveness and efficiency of employing a fully automatic algorithm for ranking the results of Boolean searches of an inverted file design document retrieval system. The study indicated that with minor modification of file designs, such as those implemented in the Syracuse Information Retrieval Experiment (SIRE), document retrieval systems could efficiently provide users with output lists on which the rank order of a document is a good indicator of its probable relevance to the user's information need. The study found that relevant documents were ranked significantly higher than nonrelevant documents in the set of documents retrieved in response to a Boolean query. By utilizing an augmented inverted file design the variable incremental cost for ranked output was only ten cents per query. There was no increased user effort.

92 citations


Journal ArticleDOI
TL;DR: In this paper, the concept of query term accuracy is introduced as the probability of occurrence of a query term in the documents relevant to that query, and it is used to give formal proofs of the effectiveness with respect to a given user query of a number of automatic indexing systems.
Abstract: The performance of information retrieval systems can be evaluated in a number of different ways. Much of the published evaluation work is based on measuring the retrieval performance of an average user query. Unfortunately, formal proofs are difficult to construct for the average case. In the present study, retrieval evaluation is based on optimizing the performance of a specific user query. The concept of query term accuracy is introduced as the probability of occurrence of a query term in the documents relevant to that query. By relating term accuracy to the frequency of occurrence of the term in the documents of a collection it is possible to give formal proofs of the effectiveness with respect to a given user query of a number of automatic indexing systems that have been used successfully in experimental situations. Among these are inverse document frequency weighting, thesaurus construction, and phrase generation.

36 citations


Journal ArticleDOI
TL;DR: The automatic procedure is superior to traditional searching procedures in terms of both recall and precision and probably for more than 80% of the inquiries the need for a documentalist as an intermediary between the user and the system can be avoided.
Abstract: A system is described for the automatic adjustment of queries addressed to information retrieval systems employing a structurised thesaurus for the coordinate indexing of an average of at least five or six descriptors per document. Starting with at least two documents considered by the user as relevant to his inquiry, the system formulates different queries using descriptors occuring in the relevant documents. Results from these queries are presented to the user for relevance assessment as a result of which the most efficient queries are automatically selected and loosened (broadened). The new documents retrieved are again checked for relevance by the user; and with new relevant documents the loop starts again. The result of the automatic procedure is independent of the point of departure. The automatic procedure is superior to traditional searching procedures in terms of both recall and precision. The automatic procedure requires more computing, but probably for more than 80% of the inquiries the need for a documentalist as an intermediary between the user and the system can be avoided.

30 citations


Journal ArticleDOI
TL;DR: The coverage of the literature on on‐line retrieval systems by eight major machine‐readable data bases was determined and it was shown that at least six data bases needed to be searched to obtain a comprehensive bibliography.
Abstract: The coverage of the literature on on‐line retrieval systems by eight major machine‐readable data bases was determined A search profile executed on these data bases produced 397 unique references Ranking the data bases by journal coverage, relevance percentage, and the number of relevant items retrieved only from that data base showed that at least six data bases needed to be searched to obtain a comprehensive bibliography These six data bases, in order of productivity, are INSPEC, CA Condensates, Social Sciences Citation Index, ERIC, MEDLINE, and BIOSIS The need for an on‐line data base in library and information science is discussed

12 citations


Book ChapterDOI
01 Jan 1977
TL;DR: A model for linearly ordering basic classes of combinatorial sets in terms of chains of partitions is developed in this article, where general procedures for locating the position of an object given the object (ranking) and for constructing an object (unranking) are described.
Abstract: A model for linearly ordering basic classes of combinatorial sets is developed in terms of chains of partitions. In this context general procedures for locating the position of an object given the object (ranking) and for constructing an object given its position (unranking) are described. A general method of associating a labeled tree with a chain of partitions together with a reduction operation producing classes of labeled graphs from trees is presented. These latter operations relate these ideas to a general setting for sequencing, ranking, and selection algorithms due to H. S. Wilf.

10 citations



Journal ArticleDOI
TL;DR: In this paper, the method of approximating a continuous distribution by a discrete distribution is used to approximate certain multidimensional ranking integrals. And the results of the above complete ranking problem are given, and the results are used to compute upper confidence bounds for mean difference in a trend situation.
Abstract: The method of approximating a continuous distribution by a discrete distribution is used to approximate certain multidimensional ranking integrals. In the location scale parameter cases the method results in a simple iterative counting algorithm. A bound on the error term is given. The algorithm is applied to the problem of completely ranking normal means and shown to be quite accurate and fast. Applications of the above complete ranking problem are given, and the results are used to compute upper confidence bounds for mean difference in a trend situation.

8 citations


01 Jan 1977
TL;DR: The relationship between LEADERSHIP CHARACTERISTICS of ACADEMIC DEANS in SEVENTH-DAY ADVENTIST COLLEGES and UNIVERSITIES to their permanence level is described in this article.
Abstract: THE RELATIONSHIP OF LEADERSHIP CHARACTERISTICS OF ACADEMIC DEANS IN SEVENTH-DAY ADVENTIST COLLEGES AND UNIVERSITIES TO THEIR PER­ FORMANCE LEVELS AS PERCEIVED BY EDUCATIONAL ADMINISTRATORS AND FACULTIES

5 citations


Journal ArticleDOI
TL;DR: A ranking of the sources used by respondents to obtain current and retrospective information shows that interactive searching is not a major source and causes of low search activity are discussed, and strategies are suggested to increase searching in academic environments.
Abstract: Survey results of active research bioscientists invited to a summer conference are presented. A ranking of the sources used by respondents to obtain current and retrospective information shows that interactive searching is not a major source. Profiles are given of searchers, potential searchers, and non‐searchers. Causes of low search activity are discussed, and strategies are suggested to increase searching in academic environments.

4 citations


Journal ArticleDOI
TL;DR: In this paper, a preschool children were given tests on number reciting, set counting, subset counting, numeral matching, and numeral selection, and the results differ with those of Wang, Resnick, and Boozer (1971) with respect to the ranking of the skill of numeral recitation.
Abstract: 24 preschool children were given tests on number reciting, set counting, subset counting, numeral matching, numeral selecting, and numeral naming. The findings differ with those of Wang, Resnick, and Boozer (1971) with respect to the ranking of the skill of numeral recitation with respect to other counting skills. They also suggest an explanation for the differences between the findings of Wang, et al., and those of Spradlin, Cotter, Stevens, and Friedman (1974) who studied similar skills of a retarded sample.

2 citations


Journal ArticleDOI
TL;DR: In this article, the authors present a rational way of collecting, selecting, and ranking problem-generating ideas to be solved by RD and propose that the idea should be technologically feasible and economically efficient, while the relevant R&D and implementation expenditure should be financially creditable.
Abstract: The present paper aims at presenting a rational way of collecting, selecting, and ranking problem-generating ideas to be solved by RD 2) that the idea should be technologically feasible and economically efficient, while the relevant R&D and implementation expenditure should be financially creditable.