scispace - formally typeset
Search or ask a question

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



Journal ArticleDOI
TL;DR: In this paper, an efficient algorithm for solving a general class of mathematical programmning problems is presented for finding a maximum likelihood ranking based on paired comparison data, which differs from a branch and bound scheme in that it searches the nodes of a tree one branch at a time.
Abstract: SUMMARY An efficient algorithm is presented for solving a general class of mathematical programmning problems. This class ineludes the specific task of finding a maximum likelihood ranking based on paired comparison data. It differs from a branch and bound scheme in that it searches the nodes of a tree one branch at a time. As a result, its time requirements appear to be better and its storage requirements are better than or as good as previous algorithms. An example from the literature is presented for illustration and comparison of this method with previous work. Computational experience is described for an important class of problems.

30 citations


01 Jan 1974

13 citations





Journal ArticleDOI
TL;DR: Using words of known selection values arranged in completely counterbalanced order, it was shown that over-ranking tends to occur at both terminal points of a series of rankings as mentioned in this paper, suggesting that errors arising out of ranking procedures may be more complex than hitherto suspected.
Abstract: Using words of known selection values arranged in completely counterbalanced order it was possible to show that over-ranking tends to occur at both terminal points of a series of rankings. The presence of other unforeseen "ranking errors" was noted, suggesting that errors arising out of ranking procedures may be more complex than hitherto suspected.

7 citations