Explicit agreement extremes for a $2\times2$ table with given marginals
Machine Learning
2020-01-22 v1 Machine Learning
Statistics Theory
Statistics Theory
Abstract
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.
Keywords
Cite
@article{arxiv.2001.07415,
title = {Explicit agreement extremes for a $2\times2$ table with given marginals},
author = {José E. Chacón},
journal= {arXiv preprint arXiv:2001.07415},
year = {2020}
}
Comments
8 pages, 2 figures