具有给定边距的$2\times2$表的显式一致极值
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。