scispace - formally typeset
Search or ask a question

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


Book
01 Jan 1978
TL;DR: The majority of the persons in this book had the advantage of being born and raised in centers of civilization, highly cultured or politically pivotal nations as mentioned in this paper, whereas Muhammad, however, was born in the year 570, in the city of Mecca, in southern Arabia, at that time a backward area of the world, far from the centers of trade, art, and learning.
Abstract: The majority of the persons in this book had the advantage of being born and raised in centers of civilization, highly cultured or politically pivotal nations. Muhammad, however, was born in the year 570, in the city of Mecca, in southern Arabia, at that time a backward area of the world, far from the centers of trade, art, and learning. Orphaned at age six, he was reared in modest surroundings. Islamic tradition tells us that he was illiterate. His economic position improved when, at age twenty-five, he married a wealthy widow. Nevertheless, as he approached forty, there was little outward indication that he was a remarkable person.

144 citations



Journal ArticleDOI
TL;DR: This paper explores the possibility of combining the two principles of ranking principles, but concludes that while neither is adequate alone, nor can any single all‐embracing ranking principle be constructed to replace the two.
Abstract: It is often suggested that information retrieval systems should rank documents rather than simply retrieving a set. Two separate reasons are adduced for this: that relevance itself is a multi‐valued or continuous variable; and that retrieval is an essentially approximate process. These two reasons lead to different ranking principles, one according to degree of relevance, the other according to probability of relevance. This paper explores the possibility of combining the two principles, but concludes that while neither is adequate alone, nor can any single all‐embracing ranking principle be constructed to replace the two. The only general solution to the problem would be to find an optimal ranking by exploring the effect on the user of every possible ranking. However, some more practical approximate solutions appear possible.

37 citations


Book
01 Jan 1978
TL;DR: This paper presents a meta-modelling approach to solving multi-criteria decision-Making problems in the context of resource allocation planning and management.
Abstract: "Interpolation Independence".- "A Multiple Criteria Decision Model for Repeated Choice Situations".- "Evaluating Joint Life-Saving Activities under Uncertainty".- "The Interactive Surrogate Worth Trade-off Method for Multiobjective Decision-Making".- "Cardinal Preference Aggregation-Rules for the Case of Certainty".- "A Simple Multi-Attribute Utility Procedure for Evaluation".- "Public Investment Decision Making with Multiple Criteria An Example of University Planning".- "Interdependent Criteria in Utility Analysis".- "A Survey of Multiattribute/Multicriterion Evaluation Theories".- "An Overview of Recent Results in Multiple Criteria Problem Solving as Developed in Aachen, Germany".- "Bicriterion Cluster Analysis as an Exploration Tool".- "Duality in Multiple Objective Linear Programming".- "Multiobjective Management of the small firm".- "Applying Multiobjective Decision Analysis to Resource Allocation Planning Problems".- "A Utility Model for Product Positioning".- "Social Decision Analysis Using Multiattribute Utility Theory".- "Ranking with Multiple Objectives".- "Interactive Integer Goal Programming: Methods and Application".- "A Theory of Naive Weights".- "Multicriteria Decision Aid Two Applications in Education Management".- "Multiattribute Risk/Benefit Analysis of Citizen Attitudes Toward Societal Issues Involving Technology".- "Condensing Multiple Criteria".- "Vector Maximum Gradient Cone Contraction Techniques".- "An Approach to Solving Multi-Person Multiple-Criteria Decision-Making Problems".- "Multiple Criteria Dominance Models: An Empirical Study of Investment Preferences".- "Toward Second Order Game Problems: Decision Dynamics in Gaming Phenomena".- "Multidimensional Measure of Risk: Prospect Rating Vector".- "A Time Sharing Computer Programming Application of A Multiple Criteria Decision Method to Energy Planning - A Progress Report".- CONFERENCE PROGRAM.- LIST OF PARTICIPANTS.

11 citations


Journal ArticleDOI
TL;DR: In this article, the NASA ranking task and similar ranking activities used to demonstrate the superiority of group thinking are examined both analytically and by means of a computer simulation for fairness of the scoring algorithm.
Abstract: The NASA ranking task and similar ranking activities used to demonstrate the superiority of group thinking are examined both analytically and by means of a computer simulation for fairness of the scoring algorithm. It is argued that the current scores cannot be used to prove the superiority of group-consensus decision making in either training or research settings. Recommendations are given for an improved modified scoring format and a discussion is presented concerning situations in which group consensus may not be desirable, based on the individual resources of the group members.

11 citations


Journal ArticleDOI
01 May 1978
TL;DR: Relevance feedback techniques as implemented in Salton's SMART DRS appear to show that it is worthwhile for user's to read abstracts prior to evaluation of full texts, and three reasonable, easily understood retrieval procedures are presented.
Abstract: Many authors (1, 2, 3, 5, 6, 7) have suggested that overall performance of a document retrieval system is improved by relevance feedback. Relevance feedback denotes the last three steps in the following process: 1) the searcher enters a query, 2) the system prepares a ranked list of suggested documents, 3) the searcher judges some of the documents for relevancy, 4) the searcher informs the system of these documents judged and of the judgement, 5) the system constructs a new query based on the descriptors used in the original query and the descriptors used in the documents judged, 6) the system prepares a second ranked list of suggested documents. The presumption is that the second list is better than the first. By all performance measures (e.g. “fluid ranking” and “frozen ranking”), the second list is better than the first. However, if one reranks documents in the original list so as to reflect the searcher's efforts (step 3), the corresponding performance measures are comparable to those for the second list. The marginal difference between the performance measures for the ”reranked original” list (searcher's efforts alone) and the second list (which includes computer efforts) makes it unclear if the cost of steps 4 through 6 above can be justified. It is hoped that advocates of relevance feedback will present “reranked original” performance measures as a basis for any performance improvement claims. This paper also presents three reasonable, easily understood retrieval procedures for which the frozen ranking, the fluid ranking, and the reranked original evaluations are “obviously” the pertinent way to evaluate. Relevance feedback techniques as implemented in Salton's SMART DRS appear to show that it is worthwhile for user's to read abstracts prior to evaluation of full texts. The last indication presented in this paper is that the relevance feedback performance improvements noted using SMART are due mostly to the user making assessments; subsequent computer efforts appear to be most likely to result in no further change. For a query for which there is a subsequent change, the change is as likely to be harmful as helpful.

8 citations


Book ChapterDOI
01 Jan 1978
TL;DR: The method is economical on the number of paired judgements that must be made by the decision maker and leads to the identification of the desired ranking and the space of weights for the corresponding linear utility functions which would lead to this ranking.
Abstract: In this paper we present an interactive method for ranking items subject to an (initially) unspecified linear utility function. The method is economical on the number of paired judgements that must be made by the decision maker and leads to the identification of the desired ranking and the space of weights for the corresponding linear utility functions which would lead to this ranking. In the simulation tests on random data it is shown that the number of comparisons that must be made at each stage tends to be less than n+1 where n is the number of criteria being used.

8 citations





Proceedings ArticleDOI
01 Jan 1978
TL;DR: This paper discusses examples of complete ranking problems, some recent advances made towards their solution, and cites sources of tables needed for their implementation.
Abstract: Many of the problems of selecting the t-best of k populations with respect to a given parameter have been successfully solved for some time. Important applications, including applications to the design and analysis of simulation experiments, have been demonstrated and the tables required for implementation of solutions are easily available (e.g. in Gibbons, Olkin and Sobel (5)).Solutions to the companion problem of completely ranking k populations have been scarce due to their mathematical complexity. This paper discusses examples of complete ranking problems, some recent advances made towards their solution, and cites sources of tables needed for their implementation.


Journal ArticleDOI
TL;DR: The complete bifurcation behavior for n = 3 and some information obtained for n > 3 was shown in this article, where it was shown that if n is fixed, the ranking function Bifurcates as r increases.
Abstract: Suppose n competitors each compete in r races and a ranking function F assigns a score F(j) to the competitor finishing in the jth position in each race. The sum of the scores over r races gives each competitor a final ranking. If n is fixed, the ranking function F bifurcates as r increases. The complete bifurcation behaviour is determined for n = 3 and some information obtained for n > 3.

Journal ArticleDOI
TL;DR: A method of determining the risk of mis-ranking a pair of examinees with a multiple-choice test with an assumption that questions guessed at were independent and had equally attractive options.
Abstract: A method of determining the risk of mis-ranking a pair of examinees with a multiple-choice test was described. Assumptions of this method were that (1) questions guessed at were independent and had equally attractive options and (2) the ratio of the number of these questions to the number of options per question was at least 5 for each examinee.


01 Jan 1978
TL;DR: In this paper, the authors present conditions générales d'utilisation of systématiques for the purposes of copyright protection, i.e., the copie ou impression of a fichier do not contenir la présente mention de copyright.
Abstract: © Centre d’analyse et de mathématiques sociales de l’EHESS, 1978, tous droits réservés. L’accès aux archives de la revue « Mathématiques et sciences humaines » (http:// msh.revues.org/) implique l’accord avec les conditions générales d’utilisation (http://www. numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright.



Journal ArticleDOI
TL;DR: In this article, an information theory approach to the ranking problems from the viewpoint of mutual information is presented, accompanied by a few illustrative examples, enabling one to obtain the optimal ranking most appropriate to the empirical data.
Abstract: This paper presents an information theory approach to the ranking problems from the viewpoint of mutual information. The method, accompanied by a few illustrative examples, enables one to obtain the optimal ranking most appropriate to the empirical data. The approach in this study is believed to stimulate a much wider scope to the production researcher's mind

Journal ArticleDOI
01 May 1978
TL;DR: This paper studies the problem of record address allocation in disk-like devices so as to facilitate the fast retrieval of a set of records which are jointly accessed by a query.
Abstract: Query retrieval based on secondary keys is an important operation in retrieval systems. Such a query generally retrieves more than one data record which satisfies the query criterion. This paper studies the problem of record address allocation in disk-like devices so as to facilitate the fast retrieval of a set of records which are jointly accessed by a query. A heuristic scheme, using the proposed minimal access retrieval property, is designed to assign records to blocks. Some experimental results are also presented.