论文标题
最小 - 最大缩放,协议的限制和协议得分
Min-Mid-Max Scaling, Limits of Agreement, and Agreement Score
论文作者
论文摘要
在本文中,我解决了科恩(Cohen)的开创性论文(1960)提出的一个60岁的问题,并提供了一项围绕机会指示协议的协议措施,同时隔离了略有强迫的协议和分歧。为了实现这一目标,我通过设计一种新算法来最大程度地减少应急表中的对角线之和,从而制定了行和柱边缘的最低可行协议。基于此结果,我还制定了最常见的协议措施-Cohen的Kappa的下限。最后,我研究了最大可行协议的下限,并设计了两个分布相似性的统计数据以进行协议分析。
In this paper, I solve a 60-year old question posed by Cohen's seminal paper (1960) and offer an agreement measure centered around the chance-expected agreement while isolating marginally forced agreement and disagreement. To achieve this, I formulate the minimum feasible agreement given row and column marginals by devising a new algorithm that minimizes the sum of diagonals in contingency tables. Based on this result, I also formulate the lower limit of the most common agreement measure-Cohen's kappa. Finally, I study the lower limit of maximum feasible agreement and devise two statistics of distribution similarity for agreement analysis.