scispace - formally typeset
Search or ask a question

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


Journal ArticleDOI
Joel Spencer1
01 Jan 1971-Networks
TL;DR: Let us be given a tournament Tn (i-e., a complete directed graph) on n players, and ask, what is the worst case?
Abstract: Let us be given a tournament Tn (i-e., a complete directed graph) on n players. It is natural to look for a ranking (linear order) L on the n players that best reflects the tournament result. Thinking of L as a complete directed transitive graph we may use IE(T) fl E(L) I, where E(T) = edge set of T, as a measure of how good a fit L is. We ask, what is the worst case. Set f (n) = min max IE(T ) nE(L) 1 . n Tn

55 citations


Journal ArticleDOI
01 Jan 1971

34 citations


Journal ArticleDOI
TL;DR: Sen Gupta's list 5 is intended to provide a useful guide for these purposes in the field of biomedical sciences, but it was felt that as it stands, the list may be of limited value in so far as periodicals of recent origin are concerned.

6 citations


Journal ArticleDOI
TL;DR: The results of an experiment simulating a library catalog search indicated that a relation exists between the lexical content load of the text, used to define the search topic, and the number of query terms generated by a group of experimental subjects (college students).
Abstract: The set of different terms used to search a directory for information on a given topic varies considerably from one searcher to another. If the topic is represented by a written text, the characteristics of the text are among the variables which influence the formulation of search terms. The results of an experiment simulating a library catalog search indicated that a relation exists between the lexical content load of the text, used to define the search topic, and the number of query terms generated by a group of experimental subjects (college students). No connection was found between the content load of the text and the commonality of query term choices. Some of the properties of “popular” as opposed to “unique,” query terms were examined. Only short terms enjoyed a high level of popularity. The repeated appearance of a term in the text favored the selection of that term by a large number of searchers.

5 citations