Phi Coefficient

In statistics, the phi coefficient (or mean square contingency coefficient and denoted by φ or r_φ) is a measure of association for two binary variables. In machine learning, it is known as the Matthews correlation coefficient (MCC) and used as a measure of the quality of binary (two-class) classifications, introduced by biochemist Brian W. Matthews in 1975. Introduced by Karl Pearson, and also known as the ''Yule phi coefficient'' from its introduction by Udny Yule in 1912 this measure is similar to the Pearson correlation coefficient in its interpretation. In fact, a Pearson correlation coefficient estimated for two binary variables will return the phi coefficient. Two binary variables are considered positively associated if most of the data falls along the diagonal cells. In contrast, two binary variables are considered negatively associated if most of the data falls off the diagonal. If we have a 2×2 table for two random variables ''x'' and ''y''

where ''n''₁₁, ''n''₁₀, ''n''₀₁, ''n''₀₀, are non-negative counts of numbers of observations that sum to ''n'', the total number of observations. The phi coefficient that describes the association of ''x'' and ''y'' is

: $\phi = \frac.$

Phi is related to the point-biserial correlation coefficient and Cohen's ''d'' and estimates the extent of the relationship between two variables (2×2).Aaron, B., Kromrey, J. D., & Ferron, J. M. (1998, November)
Equating r-based and d-based effect-size indices: Problems with a commonly recommended formula.
Paper presented at the annual meeting of the Florida Educational Research Association, Orlando, FL. (ERIC Document Reproduction Service No. ED433353)

The phi coefficient can also be expressed using only $n$, $n_$, $n_$, and $n_$, as

: $\phi = \frac.$

Maximum values

Although computationally the Pearson correlation coefficient reduces to the phi coefficient in the 2×2 case, they are not in general the same. The Pearson correlation coefficient ranges from −1 to +1, where ±1 indicates perfect agreement or disagreement, and 0 indicates no relationship. The phi coefficient has a maximum value that is determined by the distribution of the two variables if one or both variables can take on more than two values. See Davenport and El-Sanhury (1991) for a thorough discussion.

Machine learning

The MCC is defined identically to phi coefficient, introduced by Karl Pearson, also known as the Yule phi coefficient from its introduction by Udny Yule in 1912. Despite these antecedents which predate Matthews's use by several decades, the term MCC is widely used in the field of bioinformatics and machine learning.

The coefficient takes into account true and false positives and negatives and is generally regarded as a balanced measure which can be used even if the classes are of very different sizes. The MCC is in essence a correlation coefficient between the observed and predicted binary classifications; it returns a value between −1 and +1. A coefficient of +1 represents a perfect prediction, 0 no better than random prediction and −1 indicates total disagreement between prediction and observation. However, if MCC equals neither −1, 0, or +1, it is not a reliable indicator of how similar a predictor is to random guessing because MCC is dependent on the dataset. MCC is closely related to the chi-square statistic for a 2×2 contingency table

: $, \text, = \sqrt$

where ''n'' is the total number of observations.

While there is no perfect way of describing the confusion matrix of true and false positives and negatives by a single number, the Matthews correlation coefficient is generally regarded as being one of the best such measures. Other measures, such as the proportion of correct predictions (also termed accuracy), are not useful when the two classes are of very different sizes. For example, assigning every object to the larger set achieves a high proportion of correct predictions, but is not generally a useful classification.

The MCC can be calculated directly from the confusion matrix using the formula:

: $\text = \frac$

In this equation, ''TP'' is the number of true positives, ''TN'' the number of true negatives, ''FP'' the number of false positives and ''FN'' the number of false negatives. If any of the four sums in the denominator is zero, the denominator can be arbitrarily set to one; this results in a Matthews correlation coefficient of zero, which can be shown to be the correct limiting value.

The MCC can be calculated with the formula:
: $\text = \sqrt - \sqrt$
using the positive predictive value, the true positive rate, the true negative rate, the negative predictive value, the false discovery rate, the false negative rate, the false positive rate, and the false omission rate.

The original formula as given by Matthews was:
: $\begin N &= \mathit + \mathit + \mathit + \mathit \\ S &= \frac \\ P &= \frac \\ \text &= \frac \end$

This is equal to the formula given above. As a correlation coefficient, the Matthews correlation coefficient is the geometric mean of the regression coefficients of the problem and its dual. The component regression coefficients of the Matthews correlation coefficient are Markedness (Δp) and Youden's J statistic (Informedness or Δp'). Markedness and Informedness correspond to different directions of information flow and generalize Youden's J statistic, the $\delta$p statistics and (as their geometric mean) the Matthews Correlation Coefficient to more than two classes.

Some scientists claim the Matthews correlation coefficient to be the most informative single score to establish the quality of a binary classifier prediction in a confusion matrix context.

Example

Given a sample of 12 pictures, 8 of cats and 4 of dogs, where cats belong to class 1 and dogs belong to class 0,

:actual = ,1,1,1,1,1,1,1,0,0,0,0

assume that a classifier that distinguishes between cats and dogs is trained, and we take the 12 pictures and run them through the classifier, and the classifier makes 9 accurate predictions and misses 3: 2 cats wrongly predicted as dogs (first 2 predictions) and 1 dog wrongly predicted as a cat (last prediction).

:prediction = ,0,1,1,1,1,1,1,0,0,0,1
With these two labelled sets (actual and predictions) we can create a confusion matrix that will summarize the results of testing the classifier:

In this confusion matrix, of the 8 cat pictures, the system judged that 2 were dogs, and of the 4 dog pictures, it predicted that 1 was a cat. All correct predictions are located in the diagonal of the table (highlighted in bold), so it is easy to visually inspect the table for prediction errors, as they will be represented by values outside the diagonal.

In abstract terms, the confusion matrix is as follows:

where P = Positive; N = Negative; TP = True Positive; FP = False Positive; TN = True Negative; FN = False Negative.

Plugging the numbers from the formula:
:$\text = \frac = \frac \approx 0.478$

Confusion matrix

Let us define an experiment from P positive instances and N negative instances for some condition. The four outcomes can be formulated in a 2×2 '' contingency table'' or ''confusion matrix'', as follows:

Multiclass case

The Matthews correlation coefficient has been generalized to the multiclass case. This generalization was called the $R_K$ statistic (for K different classes) by the author, and defined in terms of a $K\times K$ confusion matrix $C$
.

:$\text = \frac$

When there are more than two labels the MCC will no longer range between −1 and +1. Instead the minimum value will be between −1 and 0 depending on the true distribution. The maximum value is always +1.

This formula can be more easily understood by defining intermediate variables:
* $t_k = \sum_i C_$ the number of times class k truly occurred,
* $p_k = \sum_i C_$ the number of times class k was predicted,
* $c = \sum_ C_$ the total number of samples correctly predicted,
* $s = \sum_i \sum_j C_$ the total number of samples. This allows the formula to be expressed as:

:$\text = \frac$

Using above formula to compute MCC measure for the dog and cat example discussed above, where the confusion matrix is treated as a 2 × Multiclass example:

:$\text=\frac=\frac\approx 0.478$

Advantages over accuracy and F1 score

As explained by Davide Chicco in his paper ''"Ten quick tips for machine learning in computational biology"'' ( BioData Mining, 2017) and ''"The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation"'' ( BMC Genomics, 2020), the Matthews correlation coefficient is more informative than F1 score and accuracy in evaluating binary classification problems, because it takes into account the balance ratios of the four confusion matrix categories (true positives, true negatives, false positives, false negatives).

The former article explains, for ''Tip 8'':

Chicco's passage might be read as endorsing the MCC score in cases with imbalanced data sets. This, however, is contested; in particular, Zhu (2020) offers a strong rebuttal.

Note that the F1 score depends on which class is defined as the positive class. In the first example above, the F1 score is high because the majority class is defined as the positive class. Inverting the positive and negative classes results in the following confusion matrix:

: TP = 0, FP = 0; TN = 5, FN = 95

This gives an F1 score = 0%.

The MCC doesn't depend on which class is the positive one, which has the advantage over the F1 score to avoid incorrectly defining the positive class.

See also

* Cohen's kappa
* Contingency table
* Cramér's V, a similar measure of association between nominal variables.
* F1 score
* Fowlkes–Mallows index
* Polychoric correlation (subtype: Tetrachoric correlation), when variables are seen as dichotomized versions of (latent) continuous variables

References

{{Machine learning evaluation metrics

Bioinformatics
Cheminformatics
Computational chemistry
Information retrieval evaluation
Machine learning
Statistical classification
Statistical ratios
Summary statistics for contingency tables