Phi coefficient explained

In statistics, the phi coefficient, also known as the mean square contingency coefficient or Yule coefficient of correlation and commonly denoted by φ or rφ, is a measure of association between two binary variables. In machine learning and bioinformatics, it is known as the Matthews correlation coefficient (MCC). In meteorology and elsewhere, it is referred to as the Doolittle Measure of Association or Doolittle Skill Score. Described by Udny Yule in 1912[1] and given the name phi by Karl Pearson in the 1930s,[2] it is a special case of the Pearson correlation coefficient.

Definition

A Pearson correlation coefficient estimated for two binary variables will return the phi coefficient.[3]

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

y = 1 y = 0 total
x = 1

n11

n10

n1\bullet

x = 0

n01

n00

n0\bullet

total

n\bullet1

n\bullet0

n

where n11, n10, n01, n00, 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

\varphi=

n11n00-n10n01
\sqrt{n1\bulletn0\bulletn\bullet0n\bullet1
}.

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).[4]

The phi coefficient can also be expressed using only

n

,

n11

,

n1\bullet

, and

n\bullet1

, as

\varphi=

nn11-n1\bulletn\bullet1
\sqrt{n1\bulletn\bullet1(n-n1\bullet)(n-n\bullet1)
}.

Maximum values

In general, the Pearson correlation coefficient ranges from −1 to +1, where ±1 indicates perfect agreement or disagreement, and 0 indicates no relationship. The range of the phi coefficient—a special case of the Pearson correlation coefficient—is more tightly bound when either of the binary variables are class-imbalanced.[5]

Machine learning

The Matthews correlation coefficient (MCC) is widely used in the fields of bioinformatics and machine learning to evaluate the quality of binary (two-class) classifications. It is named for biochemist Brian W. Matthews, who described the measure in a foundational 1975 paper.[6] An equivalent quantity, the Doolittle Measure of Association or Doolittle Skill Score, was used by M. H. Doolittle in the 1880s to rate the accuracy of meteorologist John Park Finley's tornado predictions and other weather forecasts.[7]

The coefficient accounts for 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.[8] 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.[9] MCC is closely related to the chi-square statistic for a 2×2 contingency table

|MCC|=\sqrt{

\chi2
n
}

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.[10] 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:

MCC=

TP x TN-FP x FN
\sqrt{(TP+FP)(TP+FN)(TN+FP)(TN+FN)

}

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 exactly one 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. In case two or more sums are zero (e.g. both labels and model predictions are all positive or negative), the limit does not exist.

The MCC can be calculated with the formula:

MCC= \sqrt{PPV x TPR x TNR x NPV

} - \sqrtusing 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{align} N&=TN+TP+FN+FP\\[6pt] S&=

TP+FN
N

\\[6pt] P&=

TP+FP
N

\\[6pt] MCC&=

TP/N-S x P
\sqrt{PS(1-S)(1-P)

} \end{align}

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′).[11] Markedness and informedness correspond to different directions of information flow and generalize Youden's J statistic, the

\deltap

statistics, while their geometric mean generalizes the Matthews correlation coefficient to more than two classes.

Some scientists consider 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.[12] [13]

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,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,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:

CatDog
Cat62
Dog13

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:

PN
PTPFN
NFPTN
where P = positive; N = negative; TP = truepositive; FP = false positive; TN = true negative; FN = false negative.

Plugging the numbers from the formula:

MCC=

6 x 3-1 x 2
\sqrt{(6+1) x (6+2) x (3+1) x (3+2)
} = \frac \approx 0.478

Confusion matrix

See main article: 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. The generalization called the

RK

statistic (for K different classes) was defined in terms of a

K x K

confusion matrix

C

[14] .[15]

MCC=

\sumk\suml\summCkkClm-CklCmk
\sqrt{\sumk\left(\sumlCkl\right)\left(\sumk'\suml'Ck'l'\right)

\sqrt{\sumk\left(\sumlClk\right)\left(\sumk'\suml'Cl'k'\right)} }

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:[16]

i

is the actual value index

j

is the predicted value index

K

is the total number of classes

tk=\sumiCik

the number of times class k truly occurred,

pk=\sumjCkj

the number of times class k was predicted,

c=\sumkCkk

the total number of samples correctly predicted,

s=\sumi\sumjCij

the total number of samples. This allows the formula to be expressed as:

MCC=

cs-\vec{t
⋅

\vec{p}}{ \sqrt{s2-\vec{p} ⋅ \vec{p}} \sqrt{s2-\vec{t} ⋅ \vec{t}} }

Cat Dog Sum
Cat6 2
Dog1 3
Sum

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:

MCC=(6+3) x {\color{green
12} - {\color{blue}5} x {\color{brown}4} - {\color{purple}7} x {\color{maroon}8}}{\sqrt{{\color{green}12}

2-{\color{blue}5}2-{\color{purple}7}2}\sqrt{{\color{green}12}2-{\color{brown}4}2-{\color{maroon}8}

2}}=32
\sqrt{4480
}\approx 0.478

An alternative generalization of the Matthews Correlation Coefficient to more than two classes was given by Powers by the definition of Correlation as the geometric mean of Informedness and Markedness.

Several generalizations of the Matthews Correlation Coefficient to more than two classes along with new Multivariate Correlation Metrics for multinary classification have been presented by P Stoica and P Babu.[17]

See also

Notes and References

  1. On the Methods of Measuring Association Between Two Attributes. Journal of the Royal Statistical Society. Yule. G. Udny. 75. 579–652. 6. 1912. 10.2307/2340126. 2340126.
  2. Cramer, H. (1946). Mathematical Methods of Statistics. Princeton: Princeton University Press, p. 282 (second paragraph). https://archive.org/details/in.ernet.dli.2015.223699
  3. Guilford, J. (1936). Psychometric Methods. New York: McGraw–Hill Book Company, Inc.
  4. 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)
  5. Davenport . E. . El-Sanhury . N. . Phi/Phimax: Review and Synthesis . Educational and Psychological Measurement . 51 . 4 . 821–8 . 1991 . 10.1177/001316449105100403 .
  6. Matthews. B. W.. Comparison of the predicted and observed secondary structure of T4 phage lysozyme. Biochimica et Biophysica Acta (BBA) - Protein Structure. 1975. 405. 2. 442–451. 10.1016/0005-2795(75)90109-9. 1180967.
  7. Armistead . Timothy W. . The American Statistician . 2016. Misunderstood and Unattributed: Revisiting M. H. Doolittle's Measures of Association, With a Note on Bayes' Theorem . 70 . 1 . 63–73 . 10.1080/00031305.2015.1086686 . 45118274 .
  8. Boughorbel. S.B . Optimal classifier for imbalanced data using Matthews Correlation Coefficient metric. PLOS ONE. 12 . 6 . e0177678 . 2017. 10.1371/journal.pone.0177678 . 28574989 . 5456046 . 2017PLoSO..1277678B . free .
  9. Chicco. D.. Tötsch. N.. Jurman. G.. The Matthews correlation coefficient (MCC) is more reliable than balanced accuracy, bookmaker informedness, and markedness in two-class confusion matrix evaluation. BioData Mining. 14 . 2021. 1. 13. 10.1186/s13040-021-00244-z. 33541410. 7863449. free.
  10. Powers . David M. W. . Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation . 10 October 2020 . cs.LG . 2010.16061.
  11. P. . Perruchet . R. . Peereman . 2004 . The exploitation of distributional information in syllable processing . J. Neurolinguistics . 17 . 2–3 . 97–119 . 10.1016/s0911-6044(03)00059-9. 17104364 .
  12. Chicco D. Ten quick tips for machine learning in computational biology. BioData Mining. 10. 35. 35. December 2017. 29234465. 10.1186/s13040-017-0155-3. 5721660. free.
  13. Chicco D, Jurman G . The Matthews correlation coefficient (MCC) should replace the ROC AUC as the standard metric for assessing binary classification . BioData Min . 16 . 1 . 4 . February 2023 . 36800973 . 9938573 . 10.1186/s13040-023-00322-4 . free .
  14. Gorodkin. Jan. Comparing two K-category assignments by a K-category correlation coefficient. Computational Biology and Chemistry. 2004. 28. 5. 367–374. 10.1016/j.compbiolchem.2004.09.006. 15556477.
  15. Web site: Gorodkin. Jan. The Rk Page. The Rk Page. 28 December 2016.
  16. Web site: Matthew Correlation Coefficient. scikit-learn.org.
  17. Stoica P and Babu P (2024), Pearson–Matthews correlation coefficients for binary and multinary classification, Elsevier Signal Processing, 222, 109511, doi = https://doi.org/10.1016/j.sigpro.2024.109511