Showing papers on "Ranking (information retrieval) published in 1976"
••
TL;DR: This work reviews those closely related to physics and others with novel features: citation analysis, use or user judgement, and size or ‘productivity’.
Abstract: Over several decades many ranking techniques have been proposed as aids to journal selection by libraries. We review those closely related to physics and others with novel features. There are three main methods of ranking: citation analysis, use or user judgement, and size or ‘productivity’. Citations offer an ‘unobtrusive’ quantitative measure, but not only is the absolute value of a citation in question, but also there is no consensus on a ‘correct’ way to choose the citing journals, nor of the ranking parameter. Citations can, however, point out anomalies and show the changing status of journals over the years. Use and user judgement also employ several alternative methods. These are in the main of limited applicability outside the specific user group in question. There is greater ‘parochialism’ in ‘use’ ranking than in ‘judged value’ lists, with citation lists the most international. In some cases, the attempted ‘quantification’ of subjective judgement will be misleading. Size and productivity rankings are normally concerned with one or other formulation of the Bradford distribution. Since the distribution is not universally valid, for library use the librarian must satisfy him/herself that the collection conforms to the distribution, or that his users would be well served by one that did. This may require considerable effort, and statistics gained will then render the Bradford distribution redundant.
53 citations
••
TL;DR: The structure of a retrospective information retrieval system that uses equifrequent word or text fragments is described, and its advantages over word oriented systems are mentioned briefly.
Abstract: The structure of a retrospective information retrieval system that uses equifrequent word or text fragments is described, and its advantages over word oriented systems are mentioned briefly. Word fragments are proposed as retrieval elements, and a discussion is given of the changes required in order to process a query. Some necessary modifications in the treatment of logical operators are described, and two conditions are postulated as necessary for the successful operation of the system. Aspects of query processing are illustrated by experimental results obtained from single and two-term queries applied to a portion of the MARC tapes.
13 citations
••
8 citations
••
TL;DR: In this article, an algorithm for finding the annth best spanning tree of an edge-weighted graph is presented, where the number of steps is a linear function of the parametern.
Abstract: An algorithm is presented for finding annth-best spanning tree of an edge-weighted graphG. In sharp contrast to related ranking algorithms, the number of steps is a linear function of the parametern. The results apply as well to ranking the bases of an abstract matroid.
4 citations
•
01 Jan 1976
1 citations
01 Jan 1976
TL;DR: In the class of ranking procedures based on sequential confidence intervals of fixed-length, the probability statements are not tmifonn in the scale parameter, and the available generalizations to rankings based on stochastic orderings are not uniform over the parameter space Q.
Abstract: In the class of ranking procedures based on sequential confidence intervals of fixed-length, the probability statements are not tmifonn in the scale parameter. Further the available generalizations to rankings based on stochastic orderings are not uniform over the parameter space Q. 1\'10 methods are proposed for solving such problems; the first is based on the theory of weak convergence while the second is more direct but only solves the problem when Q is compact.