In this section several relationships between the new kappa coefficients for dichotomous-nominal classifications are presented.
Theorem 1 shows that if the classifiers do not use the ‘absence’ category, then the kappa coefficient in (11) is identical to Cohen’s ordinary kappa (Cohen 1960). This property makes a lot of sense, since if the ‘absence’ category is not used, dichotomous-nominal classifications are de facto regular nominal classifications, and Cohen’s kappa is a standard tool for quantifying agreement between regular nominal classifications with identical categories.
Theorem 1
If ‘absence’ category \(A_c\) is not used by the classifiers, then \(\kappa _u=\kappa _0\).
Proof
If only ‘presence’ categories are used we have \(\pi _{c+}=\pi _{+c}=0\). In this case we have \(\lambda _2=0\) and \(\mu _2=0\), and thus the identities \(\lambda _1=1-\lambda _0\) and \(\mu _1=1-\mu _0\). Using these identities in (11) we obtain
$$\begin{aligned} \kappa _u=\frac{\lambda _0+u(1-\lambda _0)-\mu _0-u(1-\mu _0)}{1-\mu _0-u(1-\mu _0)}=\frac{(1-u)\lambda _0-(1-u)\mu _0}{1-u-(1-u)\mu _0}. \end{aligned}$$
(20)
Dividing all terms on the right-hand side of (20) by \((1-u)\) yields the coefficient in (18). \(\square \)
Theorem 2 shows that the kappa coefficient in (19) is identical to the coefficient that is obtained if we combine all the ‘presence’ categories \(A_1,\ldots ,A_{c-1}\) into a single ‘presence’ category, and then calculate Cohen’s ordinary kappa for the collapsed \(2\times 2\) table.
Theorem 2
Coefficient \(\kappa _1\) is obtained if we combine the ‘presence’ categories \(A_1,\ldots ,A_{c-1}\), and then calculate coefficient (18) for the collapsed \(2\times 2\) table.
Proof
Let \(\lambda ^*_0\), \(\mu ^*_0\) and \(\kappa ^*_0\) denote, respectively, the values of \(\lambda _0\), \(\mu _0\) and \(\kappa _0\) for the collapsed \(2\times 2\) table. If we combine categories \(A_1,\ldots ,A_{c-1}\) we have \(\lambda ^*_0=\lambda _0+\lambda _1\) and \(\mu ^*_0=\mu _0+\mu _1\). Hence, the coefficient in (18) for the collapsed \(2\times 2\) table is equal to
$$\begin{aligned} \kappa ^*_0=\frac{\lambda ^*_0-\mu ^*_0}{1-\mu ^*_0} =\frac{\lambda _0+\lambda _1-\mu _0-\mu _1}{1-\mu _0-\mu _1}, \end{aligned}$$
(21)
which is equivalent to the coefficient in (19). \(\square \)
Theorem 2 provides several ways to interpret coefficient \(\kappa _1\) in (19). First of all, the coefficient may be interpreted as a ‘presence’ versus ‘absence’ kappa coefficient. Furthermore, the procedure of combining all other categories (in this case all ‘presence’ categories) except a category of interest (in this case the ‘absence’ category), followed by calculating Cohen’s ordinary kappa for the collapsed \(2\times 2\) table, defines a category kappa for the category of interest (in this case the ‘absence’ category) (Kraemer 1979; Warrens 2011, 2015). Category kappas can be used to quantify agreement between the classifiers for individual categories. Hence, coefficient \(\kappa _1\) in (19) is the kappa coefficient for the ‘absence’ category.
Theorem 3 presents an alternative formula for coefficient \(\kappa _1\). It turns out that we only need three numbers to calculate this coefficient, regardless of the size of the total number of categories, namely, the values of \(\pi _{cc}\), \(\pi _{c+}\) and \(\pi _{+c}\).
Theorem 3
Coefficient \(\kappa _1\) can be calculated using
$$\begin{aligned} \kappa _1=\frac{\pi _{cc}-\pi _{c+}\pi _{+c}}{\dfrac{\pi _{c+}+\pi _{+c}}{2}-\pi _{c+}\pi _{+c}}. \end{aligned}$$
(22)
Proof
Using identities (6c) and (7c), the coefficient in (19) can be expressed as
$$\begin{aligned} \kappa _1=\frac{1-\lambda _2-(1-\mu _2)}{1-(1-\mu _2)} =\frac{\mu _2-\lambda _2}{\mu _2}. \end{aligned}$$
(23)
Using the identities \(\lambda _2=\pi _{c+}+\pi _{+c}-2\pi _{cc}\) and \(\mu _2=\pi _{c+}(1-\pi _{+c})+\pi _{+c}(1-\pi _{c+})\) in (23) yields
$$\begin{aligned} \kappa _1=\frac{2(\pi _{cc}-\pi _{c+}\pi _{+c})}{\pi _{c+}+\pi _{+c}-2\pi _{c+}\pi _{+c}}. \end{aligned}$$
(24)
Dividing all terms on the right-hand side of (24) by 2, we get the expression in (22).
Theorem 4 shows that all special cases of (11) coincide with \(c=2\) categories.
Theorem 4
If \(c=2\), then \(\kappa _u=\kappa _0\).
Proof
If \(A_1\) is the only ‘presence’ category and \(A_2\) is the ‘absence’ category, there is no disagreement between the classifiers on ‘presence’ categories, that is, \(\lambda _1=0\) and \(\mu _1=0\). Using \(\lambda _1=0\) and \(\mu _1=0\) in (11) we obtain
$$\begin{aligned} \kappa _u=\frac{\lambda _0-\mu _0}{1-\mu _0}, \end{aligned}$$
(25)
which is the coefficient in (18).
Since all special cases coincide with \(c=2\) categories (Theorem 4), we assume from here on that \(c\ge 3\).
Theorem 5 states that the kappa coefficient in (11) is a weighted average of the kappa coefficients in (18) and (19). The proof of Theorem 5 follows from simplifying the expression on the right-hand side of (26).
Theorem 5
Coefficient \(\kappa _u\) is a weighted average of \(\kappa _0\) and \(\kappa _1\) using, respectively, \((1-u)(1-\mu _0)\) and \(u(1-\mu _0-\mu _1)\) as weights:
$$\begin{aligned} \kappa _u=\frac{(1-u)(1-\mu _0)\kappa _0+u(1-\mu _0-\mu _1) \kappa _1}{(1-u)(1-\mu _0)+u(1-\mu _0-\mu _1)}. \end{aligned}$$
(26)
Since \(\kappa _u\) is a weighted average of \(\kappa _0\) and \(\kappa _1\) (Theorem 5) all values of \(\kappa _u\) for \(u\in (0,1)\) are between \(\kappa _0\) and \(\kappa _1\) when \(\kappa _0\ne \kappa _1\). Coefficients \(\kappa _0\) and \(\kappa _1\) are the minimum and maximum values of \(\kappa _u\) on \(u\in [0,1]\). For example, consider the numbers in Table 3. For both Tables 1 and 2 coefficient \(\kappa _0\) is the minimum and \(\kappa _1\) is the maximum value.
Theorem 6 shows that there exist precisely two orderings of the kappa coefficients for dichotomous-nominal classifications, as long as \(\kappa _0\ne \kappa _1\). If we have \(\kappa _0=\kappa _1\) the value of \(\kappa _u\) does not depend on u, or in other words, the values of all kappa coefficients for dichotomous-nominal classifications coincide.
Theorem 6
If \(\kappa _0<\kappa _1\), then \(\kappa _u\) is strictly increasing and concave upward on \(u\in [0,1]\). Conversely, if \(\kappa _0>\kappa _1\), then \(\kappa _u\) is strictly decreasing and concave downward on \(u\in [0,1]\).
Proof
The first derivative of (26) with respect to u is given by
$$\begin{aligned} \frac{d\kappa _u}{du}=\frac{(\kappa _1-\kappa _0)(1-\mu _0)(1-\mu _0-\mu _1)}{[(1-u)(1-\mu _0)+u(1-\mu _0-\mu _1)]^2}, \end{aligned}$$
(27)
and the second derivative of (26) with respect to u is given by
$$\begin{aligned} \frac{d^2\kappa _u}{du^2}=\frac{2\mu _1(\kappa _1-\kappa _0)(1-\mu _0) (1-\mu _0-\mu _1)}{[(1-u)(1-\mu _0)+u(1-\mu _0-\mu _1)]^3}. \end{aligned}$$
(28)
Since the quantities \((1-\mu _0)\) and \((1-\mu _0-\mu _1)\) in the numerators of (27) and (28), together with the denominators of (27) and (28), are strictly positive, (27) and (28) are strictly positive if \(\kappa _0<\kappa _1\). Since (27) is strictly positive if \(\kappa _0<\kappa _1\), (26) and (11) are strictly increasing on \(u\in [0,1]\). Furthermore, since (28) is strictly positive if \(\kappa _0<\kappa _1\), (26) and (11) are concave upward on \(u\in [0,1]\). \(\square \)
The properties presented in Theorem 6 can be illustrated with the numbers in Table 3. For both Tables 1 and 2 the values of the new coefficients are strictly increasing from \(\kappa _0\) to \(\kappa _1\). Furthermore, the coefficient values near \(u=0\) (i.e. near \(\kappa _0\)) are closer together than the coefficient values near \(u=1\) (i.e. near \(\kappa _1\)). The latter illustrates the concave upward property.
Theorem 7 presents a condition that is equivalent to the inequality \(\kappa _0<\kappa _1\). The latter inequality holds if the ratio of observed disagreement between the ‘presence’ categories \(A_1,\ldots ,A_{c-1}\) to the corresponding expected disagreement under independence of the classifiers, exceeds the ratio of the observed disagreement between ‘absence’ category \(A_c\) on the one hand, and the ‘presence’ categories on the other hand, to the corresponding expected disagreement (i.e. condition ii. of Theorem 7).
Theorem 7
The following conditions are equivalent.
-
i.
\(\kappa _0<\kappa _1\);
-
ii.
\(\dfrac{\lambda _1}{\mu _1}>\dfrac{\lambda _2}{\mu _2}\).
Proof
Using identities (6c) and (7c) we have
$$\begin{aligned} \kappa _0=\frac{\mu _1+\mu _2-\lambda _1-\lambda _2}{\mu _1+\mu _2}=1-\frac{\lambda _1+\lambda _2}{\mu _1+\mu _2} \end{aligned}$$
(29)
and
$$\begin{aligned} \kappa _1=\frac{\mu _2-\lambda _2}{\mu _2}=1-\frac{\lambda _2}{\mu _2}. \end{aligned}$$
(30)
Hence, condition i. (inequality \(\kappa _0<\kappa _1\)) is equivalent to
$$\begin{aligned} \frac{\lambda _1+\lambda _2}{\mu _1+\mu _2}>\frac{\lambda _2}{\mu _2}. \end{aligned}$$
(31)
Condition ii. is then obtained by cross multiplying the terms of (31), followed by deleting terms that are on both sides of the inequality, and finally rearranging the remaining terms. \(\square \)
Theorems 6 and 7 show that if one of the two conditions of Theorem 7 holds then all special cases of (11) are strictly ordered. Moreover, the kappa coefficients can be ordered in precisely two ways. Furthermore, Theorem 7 also provides a condition under which all the new kappa coefficients obtain the same value, which can be empirically checked:
$$\begin{aligned} \frac{\lambda _1}{\mu _1}=\dfrac{\lambda _2}{\mu _2}. \end{aligned}$$
(32)
If (32) holds, we have \(\kappa _0=\kappa _1\) and all the new kappa coefficients produce the same value.