Adjusting the adjusted Rand Index – A multinomial story

11/17/2020
by   Martina Sundqvist, et al.
0

The Adjusted Rand Index (ARI) is arguably one of the most popular measures for cluster comparison. The adjustment of the ARI is based on a hypergeometric distribution assumption which is unsatisfying from a modeling perspective as (i) it is not appropriate when the two clusterings are dependent, (ii) it forces the size of the clusters, and (iii) it ignores randomness of the sampling. In this work, we present a new "modified" version of the Rand Index. First, we redefine the MRI by only counting the pairs consistent by similarity and ignoring the pairs consistent by difference, increasing the interpretability of the score. Second, we base the adjusted version, MARI, on a multinomial distribution instead of a hypergeometric distribution. The multinomial model is advantageous as it does not force the size of the clusters, properly models randomness, and is easily extended to the dependant case. We show that the ARI is biased under the multinomial model and that the difference between the ARI and MARI can be large for small n but essentially vanish for large n, where n is the number of individuals. Finally, we provide an efficient algorithm to compute all these quantities ((A)RI and M(A)RI) by relying on a sparse representation of the contingency table in our aricode package. The space and time complexity is linear in the number of samples and importantly does not depend on the number of clusters as we do not explicitly compute the contingency table.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/03/2015

Adjusting for Chance Clustering Comparison Measures

Adjusted for chance measures are widely used to compare partitions/clust...
research
12/07/2021

A more efficient algorithm to compute the Rand Index for change-point problems

In this paper we provide a more efficient algorithm to compute the Rand ...
research
01/07/2019

Understanding partition comparison indices based on counting object pairs

In unsupervised machine learning, agreement between partitions is common...
research
10/01/2019

Deep Lifetime Clustering

The goal of lifetime clustering is to develop an inductive model that ma...
research
02/10/2020

Minimum adjusted Rand index for two clusterings of a given size

In an unpublished presentation, Steinley reported that the minimum adjus...
research
10/07/2021

Adjustment of force-gradient operator in symplectic methods

Many force-gradient explicit symplectic integration algorithms have been...

Please sign up or login with your details

Forgot password? Click here to reset