论文检索

成对比较排序的极大似然估计：一种广义方法AI 解读

In many situations one is faced with the task of constructing a linear order, or ranking, of n objects based on data derived from a paired comparison experiment. Alternatively, one may desire to estimate the preference relation on the set of objects. Numerous criteria appear in the literature, and in practice, under which rankings or preferences may be selected. The main emphasis of this paper is on developing a general approach to maximum likelihood estimation of rankings…

配对比较最大似然排序的分支搜索算法AI 解读

An efficient algorithm is presented for solving a general class of mathematical programming problems. This class includes 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…

An efficient algorithm is presented for solving a general class of mathematical programming problems. This class includes 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…