scispace - formally typeset
Search or ask a question

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


Journal ArticleDOI
TL;DR: A more general version of the well-known selection problem is formulated, in which constraints on the input set are allowed and an asymptotically significant dependency on the rank of the solution element is included.
Abstract: A more general version of the well-known selection problem is formulated, in which constraints on the input set are allowed. Selection (and also ranking) problems are solved optimally for the broad class of inputs constrained to be collections of matrices with sorted rows and sorted columns.The characterization of problem complexity includes an asymptotically significant dependency on the rank of the solution element.

207 citations




Proceedings Article
27 Aug 1984
TL;DR: This paper describes manipulation rules for queries that include outerjoins, and views or nested subqueries, in terms of relational algebra, so that one can use the ordinary mechanisms of query optimization and view substitution with a minimum of disrupt ion.
Abstract: A crucial part of relational query optimization is the reordering of query processing for more efficient query evaluation. The reordering may be explicit or implicit. Our major goal in this paper is to describe manipulation rules for queries that include outerjoins, and views or nested subqueries. By expressing queries and processing Strategies in terms of relational algebra, one can use the ordinary mechanisms of query optimization and view substitution with a minimum of disrupt ion. We also aggregate operators, universal sorting.

45 citations


Journal ArticleDOI
TL;DR: In this study, two recently proposed automatic methods for relevance feedback of Boolean queries are evaluated and conclusions are drawn concerning the use of effective feedback methods in a Boolean query environment.
Abstract: The relevance feedback process uses information derived from an initially retrieved set of documents to improve subsequent search formulations and retrieval output. In a Boolean query environment this implies that new query terms must be identified and Boolean operators must be chosen automatically to connect the various query terms. In this study, two recently proposed automatic methods for relevance feedback of Boolean queries are evaluated and conclusions are drawn concerning the use of effective feedback methods in a Boolean query environment.

35 citations


Journal ArticleDOI
TL;DR: The sequence of events in the development of the brain in staged human embryos was investigated in much greater detail than in previous studies by listing 100 features in 165 embryos of the first 5 weeks using a computerized bubble-sort algorithm.
Abstract: The sequence of events in the development of the brain in staged human embryos was investigated in much greater detail than in previous studies by listing 100 features in 165 embryos of the first 5 weeks. Using a computerized bubble-sort algorithm, individual embryos were ranked in ascending order of the features present. This procedure made feasible an appreciation of the slight variation found in the developmental features. The vast majority of features appeared during either one or two stages (about 2 or 3 days). In general, the soundness of the Carnegie system of embryonic staging was amply confirmed. The rhombencephalon was found to show increasing complexity around stage 13, and the postoptic portion of the diencephalon underwent considerable differentiation by stage 15. The need for similar investigations of other systems of the body is emphasized, and the importance of such studies in assessing the timing of congenital malformations and in clarifying syndromic clusters is suggested.

33 citations


Journal ArticleDOI
TL;DR: ANNOD is a retrieval system which combines use of probabilistic, linguistic, and empirical means to rank individual paragraphs of full text for their similarity to natural language queries proposed by users.
Abstract: “A Navigator of Natural Language Organized Data” (ANNOD) is a retrieval system which combines use of probabilistic, linguistic, and empirical means to rank individual paragraphs of full text for their similarity to natural language queries proposed by users. ANNOD includes common word deletion, word root isolation, query expansion by a thesaurus, and application of a complex empirical matching (ranking) algorithm. The Hepatitis Knowledge Base, the text of a prototype information system, was the file used for testing ANNOD. Responses to a series of users' unrestricted natural language queries were evaluated by three testers. Information needed to answer 85 to 95‰ of the queries was located and displayed in the first few selected paragraphs. It was successful in locating information in both the classified (listed in Table of Contents) and unclassified portions of text. Development of this retrieval system resulted from the complementarity of and interaction between computer science and medical domain expert knowledge. Extension of these techniques to larger knowledge bases is needed to clarify their proper role.

24 citations


Journal Article

11 citations



Journal ArticleDOI
TL;DR: In this paper, the authors of the five best macromonetary articles published in the 1970s were asked to answer a questionnaire, asking for the titles of their five best macroeco nomics, money and banking, and monetary articles.
Abstract: The purpose of academic publishing is to advance the frontier of knowledge. Academic and nonacademic interest should be focused on those articles which are the best ones written in any particular area. However, the declining relative demand for economists and the concomitant institution of higher stand ards for tenure and other permanent employ ment has resulted in a growing number of articles on the character of academic journals. Articles have focused on the editorial policies [4 and 22] and on the quality [7 and 13] of journals; in addition, journal articles have been used as a means of ranking academic departments [6 and 18]. The purpose of this note, in contrast, is to ascertain which macromonetary (macroeco nomics, money and banking, and monetary) articles are the frontier articles of the 1970s.1 A questionnaire, asking for the titles of the five best macromonetary articles published in the 1970s, was sent to a sample of 30 authors of \"lead\" macromonetary articles published in the past decade in three established jour nals {American Economic Review, Journal of Finance, and Journal of Political Economy) and three newer macromonetary journals {Brookings Papers on Economic Activity, Journal of Monetary Economics, and Journal of Money, Credit and Banking). An elite biased sample was chosen because a recent article [16] which tested potential indicators of an article's lasting importance (republish ability) disclosed that the only significant de

3 citations




Patent
06 Jun 1984
TL;DR: In this paper, the authors propose to make it unnecessary to execute a search by recording in advance a ranking information of a medium defect in a home address and a count part, which can be used to avoid unnecessary searching.
Abstract: PURPOSE:To make it unnecessary to execute a search by recording in advance a ranking information of a medium defect in a home address and a count part CONSTITUTION:A ranking information DPn (n=-1, 0,) of a medium defect X is added and recorded in a home address and count part storing circuit 47 A number of the medium defect X which becomes an object to be avoided in a key part RnK of the n-th record Rn is DPn, and an arithmetic circuit 46 reads it out of the home address and count storing part 47 By a relation of a medium defect (m)=DPn, the arithmetic circuit 46 can obtain (m) immediately without executing a search As a result, the arithmetic circuit 46 reads out an address of SDm, and checks whether the medium defect X exists in RnK or not from a distance Lk and SDm In this way, it is possible to make a search unnecessary