Rand index

Example clusterings for a dataset with the kMeans (left) and Mean shift (right) algorithms. The calculated Adjusted Rand index for these two clusterings is ${\displaystyle ARI\approx 0.94}$

The Rand index ^[1] or Rand measure (named after William M. Rand) in statistics, and in particular in data clustering, is a measure of the similarity between two data clusterings. A form of the Rand index may be defined that is adjusted for the chance grouping of elements, this is the adjusted Rand index. The Rand index is the accuracy of determining if a link belongs within a cluster or not.

Rand index

Definition

Given a set of ${\displaystyle n}$ elements ${\displaystyle S=\{o_{1},\ldots ,o_{n}\}}$ and two partitions of ${\displaystyle S}$ to compare, ${\displaystyle X=\{X_{1},\ldots ,X_{r}\}}$, a partition of S into r subsets, and ${\displaystyle Y=\{Y_{1},\ldots ,Y_{s}\}}$, a partition of S into s subsets, define the following:

• ${\displaystyle a}$, the number of pairs of elements in ${\displaystyle S}$ that are in the same subset in ${\displaystyle X}$ and in the same subset in ${\displaystyle Y}$
• ${\displaystyle b}$, the number of pairs of elements in ${\displaystyle S}$ that are in different subsets in ${\displaystyle X}$ and in different subsets in ${\displaystyle Y}$
• ${\displaystyle c}$, the number of pairs of elements in ${\displaystyle S}$ that are in the same subset in ${\displaystyle X}$ and in different subsets in ${\displaystyle Y}$
• ${\displaystyle d}$, the number of pairs of elements in ${\displaystyle S}$ that are in different subsets in ${\displaystyle X}$ and in the same subset in ${\displaystyle Y}$

The Rand index, ${\displaystyle R}$, is: ^{[1] [2]}

${\displaystyle R={\frac {a+b}{a+b+c+d}}={\frac {a+b}{n \choose 2}}}$

Intuitively, ${\displaystyle a+b}$ can be considered as the number of agreements between ${\displaystyle X}$ and ${\displaystyle Y}$ and ${\displaystyle c+d}$ as the number of disagreements between ${\displaystyle X}$ and ${\displaystyle Y}$.

Since the denominator is the total number of pairs, the Rand index represents the frequency of occurrence of agreements over the total pairs, or the probability that ${\displaystyle X}$ and ${\displaystyle Y}$ will agree on a randomly chosen pair.

${\displaystyle {n \choose 2}}$ is calculated as ${\displaystyle n(n-1)/2}$.

Similarly, one can also view the Rand index as a measure of the percentage of correct decisions made by the algorithm. It can be computed using the following formula:

${\displaystyle RI={\frac {TP+TN}{TP+FP+FN+TN}}}$

where ${\displaystyle TP}$ is the number of true positives, ${\displaystyle TN}$ is the number of true negatives, ${\displaystyle FP}$ is the number of false positives, and ${\displaystyle FN}$ is the number of false negatives.

Properties

The Rand index has a value between 0 and 1, with 0 indicating that the two data clusterings do not agree on any pair of points and 1 indicating that the data clusterings are exactly the same.

In mathematical terms, a, b, c, d are defined as follows:

• ${\displaystyle a=|S^{*}|}$, where ${\displaystyle S^{*}=\{(o_{i},o_{j})\mid o_{i},o_{j}\in X_{k},o_{i},o_{j}\in Y_{l}\}}$
• ${\displaystyle b=|S^{*}|}$, where ${\displaystyle S^{*}=\{(o_{i},o_{j})\mid o_{i}\in X_{k_{1}},o_{j}\in X_{k_{2}},o_{i}\in Y_{l_{1}},o_{j}\in Y_{l_{2}}\}}$
• ${\displaystyle c=|S^{*}|}$, where ${\displaystyle S^{*}=\{(o_{i},o_{j})\mid o_{i},o_{j}\in X_{k},o_{i}\in Y_{l_{1}},o_{j}\in Y_{l_{2}}\}}$
• ${\displaystyle d=|S^{*}|}$, where ${\displaystyle S^{*}=\{(o_{i},o_{j})\mid o_{i}\in X_{k_{1}},o_{j}\in X_{k_{2}},o_{i},o_{j}\in Y_{l}\}}$

for some ${\displaystyle 1\leq i,j\leq n,i\neq j,1\leq k,k_{1},k_{2}\leq r,k_{1}\neq k_{2},1\leq l,l_{1},l_{2}\leq s,l_{1}\neq l_{2}}$

Relationship with classification accuracy

The Rand index can also be viewed through the prism of binary classification accuracy over the pairs of elements in ${\displaystyle S}$. The two class labels are "${\displaystyle o_{i}}$ and ${\displaystyle o_{j}}$ are in the same subset in ${\displaystyle X}$ and ${\displaystyle Y}$" and "${\displaystyle o_{i}}$ and ${\displaystyle o_{j}}$ are in different subsets in ${\displaystyle X}$ and ${\displaystyle Y}$".

In that setting, ${\displaystyle a}$ is the number of pairs correctly labeled as belonging to the same subset (true positives), and ${\displaystyle b}$ is the number of pairs correctly labeled as belonging to different subsets (true negatives).

Adjusted Rand index

The adjusted Rand index is the corrected-for-chance version of the Rand index. ^{[1] [2] [3]} Such a correction for chance establishes a baseline by using the expected similarity of all pair-wise comparisons between clusterings specified by a random model. Traditionally, the Rand Index was corrected using the Permutation Model for clusterings (the number and size of clusters within a clustering are fixed, and all random clusterings are generated by shuffling the elements between the fixed clusters). However, the premises of the permutation model are frequently violated; in many clustering scenarios, either the number of clusters or the size distribution of those clusters vary drastically. For example, consider that in K-means the number of clusters is fixed by the practitioner, but the sizes of those clusters are inferred from the data. Variations of the adjusted Rand Index account for different models of random clusterings. ^[4]

Though the Rand Index may only yield a value between 0 and +1, the adjusted Rand index can yield negative values if the index is less than the expected index. ^[5]

The contingency table

Given a set S of n elements, and two groupings or partitions (e.g. clusterings) of these elements, namely ${\displaystyle X=\{X_{1},X_{2},\ldots ,X_{r}\}}$ and ${\displaystyle Y=\{Y_{1},Y_{2},\ldots ,Y_{s}\}}$, the overlap between X and Y can be summarized in a contingency table ${\displaystyle \left[n_{ij}\right]}$ where each entry ${\displaystyle n_{ij}}$ denotes the number of objects in common between ${\displaystyle X_{i}}$ and ${\displaystyle Y_{j}}$ : ${\displaystyle n_{ij}=|X_{i}\cap Y_{j}|}$.

${\displaystyle {\begin{array}{c|cccc|c}{{} \atop X}\!\diagdown \!^{Y}&Y_{1}&Y_{2}&\cdots &Y_{s}&{\text{sums}}\\\hline X_{1}&n_{11}&n_{12}&\cdots &n_{1s}&a_{1}\\X_{2}&n_{21}&n_{22}&\cdots &n_{2s}&a_{2}\\\vdots &\vdots &\vdots &\ddots &\vdots &\vdots \\X_{r}&n_{r1}&n_{r2}&\cdots &n_{rs}&a_{r}\\\hline {\text{sums}}&b_{1}&b_{2}&\cdots &b_{s}&\end{array}}}$

Definition

The original Adjusted Rand Index using the Permutation Model is

${\displaystyle ARI={\frac {\left.\sum _{ij}{\binom {n_{ij}}{2}}-\left[\sum _{i}{\binom {a_{i}}{2}}\sum _{j}{\binom {b_{j}}{2}}\right]\right/{\binom {n}{2}}}{\left.{\frac {1}{2}}\left[\sum _{i}{\binom {a_{i}}{2}}+\sum _{j}{\binom {b_{j}}{2}}\right]-\left[\sum _{i}{\binom {a_{i}}{2}}\sum _{j}{\binom {b_{j}}{2}}\right]\right/{\binom {n}{2}}}}}$

where ${\displaystyle n_{ij},a_{i},b_{j}}$ are values from the contingency table.

See also

• Simple matching coefficient

References

1. W. M. Rand (1971). "Objective criteria for the evaluation of clustering methods". Journal of the American Statistical Association . American Statistical Association. 66 (336): 846–850. doi:10.2307/2284239. JSTOR   2284239.
2. Lawrence Hubert and Phipps Arabie (1985). "Comparing partitions". Journal of Classification. 2 (1): 193–218. doi:10.1007/BF01908075.
3. Nguyen Xuan Vinh, Julien Epps and James Bailey (2009). "Information Theoretic Measures for Clustering Comparison: Is a Correction for Chance Necessary?" (PDF). ICML '09: Proceedings of the 26th Annual International Conference on Machine Learning. ACM. pp. 1073–1080. PDF.
4. Alexander J Gates and Yong-Yeol Ahn (2017). "The Impact of Random Models on Clustering Similarity" (PDF). Journal of Machine Learning Research. 18: 1–28.
5. "Comparing Clusterings - An Overview" (PDF).

External links

• C++ implementation with MATLAB mex files