de VRIES
Ethology & Socio-ecology Group, Utrecht University
Anim Behav. 1998 Apr;55(4):827-43. doi: 10.1006/anbe.1997.0708.
A procedure for ordering a set of individuals into a linear or near-linear dominance hierarchy is presented. Two criteria are used in a prioritized way in reorganizing the dominance matrix to find an order that is most consistent with a linear hierarchy: first, minimization of the numbers of inconsistencies and, second, minimization of the total strength of the inconsistencies. The linear ordering procedure, which involves an iterative algorithm based on a generalized swapping rule, is feasible for matrices of up to 80 individuals. The procedure can be applied to any dominance matrix, since it does not make any assumptions about the form of the probabilities of winning and losing. The only assumption is the existence of a linear or near-linear hierarchy which can be verified by means of a linearity test. A review of existing ranking methods is presented and these are compared with the proposed method. Copyright 1998 The Association for the Study of Animal Behaviour. Copyright 1998 The Association for the Study of Animal Behaviour.
本文提出了一种将一组个体排列成线性或近似线性优势等级的程序。在重新组织优势矩阵以找到与线性等级最一致的顺序时，以优先顺序使用了两个标准：第一，将不一致的数量最小化；第二，将不一致的总强度最小化。线性排序程序涉及基于广义交换规则的迭代算法，对于多达80个个体的矩阵是可行的。该程序可以应用于任何优势矩阵，因为它对输赢概率的形式不做任何假设。唯一的假设是存在线性或近似线性等级，这可以通过线性测试来验证。本文对现有的排序方法进行了综述，并将它们与所提出的方法进行了比较。版权所有1998动物行为研究协会。版权所有1998动物行为研究协会。
