Explicit agreement extremes for a 2×2 table with given marginals

01/21/2020

∙

by   José E. Chacón, et al.

∙

0

∙

share

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.