z-logo
open-access-imgOpen Access
Comparing two partitions of non-equal sets of units
Author(s) -
Marjan Cugmas,
Anus̆ka Ferligoj
Publication year - 2018
Publication title -
metodološki zvezki
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.127
H-Index - 7
eISSN - 1854-0031
pISSN - 1854-0023
DOI - 10.51936/aidm7546
Subject(s) - partition (number theory) , intersection (aeronautics) , index (typography) , mathematics , value (mathematics) , combinatorics , set (abstract data type) , stability (learning theory) , statistics , computer science , machine learning , world wide web , programming language , engineering , aerospace engineering
Rand (1971) proposed what has since become a well-known index for comparing two partitions obtained on the same set of units. The index takes a value on the interval between 0 and 1, where a higher value indicates more similar partitions. Sometimes, e.g. when the units are observed in two time periods, the splitting and merging of clusters should be considered differently, according to the operationalization of the stability of clusters. The Rand Index is symmetric in the sense that both the splitting and merging of clusters lower the value of the index. In such a nonsymmetric case, one of the Wallace indexes (Wallace, 1983) can be used. Further, there are several cases when one wants to compare two partitions obtained on different sets of units, where the intersection of these sets of units is a non-empty set of units. In this instance, the new units and units which leave the clusters from the first partition can be considered as a factor lowering the value of the index. Therefore, a modified Rand index is presented. Because the splitting and merging of clusters have to be considered differently in some situations, an asymmetric modified Wallace Index is also proposed. For all presented indices, the correction for chance is described, which allows different values of a selected index to be compared.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here