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.
翻译:在这份文件中,我解决了科恩的开创性文件(1960年)提出的一个60年前的问题,提出了围绕预期机会协议的一项协议措施,同时将勉强强迫达成的协议和分歧排除在外。为此,我制定了一套新的算法,最大限度地减少应急表格中的对角体之和,以此来制定最低可行的协议。我还根据这一结果制定了最共同协议措施的下限-科亨的卡帕。最后,我研究了最大可行协议的下限,并为协议分析设计了两种相似分布的统计。