论文标题
$ 2 \ times 2 $表的明确协议与给定边缘
Explicit agreement extremes for a $2\times2$ table with given marginals
论文作者
论文摘要
可以在一个共同的框架下正式提出（或最小化）聚类之间（或最小化）聚类之间的一致性的问题。到目前为止，只能通过数值算法找到其解决方案。在这里，显示了两个聚类有两个簇的情况，显示了一个明确的解决方案。
The problem of maximizing (or minimizing) the agreement between clusterings, subject to given marginals, can be formally posed under a common framework for several agreement measures. Until now, it was possible to find its solution only through numerical algorithms. Here, an explicit solution is shown for the case where the two clusterings have two clusters each.
