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.

中文翻译：

---

具有给定边际的 2 × 2 表的显式一致性极值

根据给定的边际，最大化（或最小化）聚类之间的一致性的问题可以在几个协议度量的共同框架下正式提出。到目前为止，只有通过数值算法才能找到它的解决方案。此处，针对两个聚类各有两个聚类的情况显示了显式解决方案。