Phi coefficient
≈ 7 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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 and given the name phi by Karl Pearson in the 1930s, it is a special case of the Pearson correlation coefficient.
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 and given the name phi by Karl Pearson in the 1930s, it is a special case of the Pearson correlation coefficient. \varphi = \frac{n_{11}n_{00}-n_{10}n_{01}}{\sqrt{n_{1\bullet}n_{0\bullet}n_{\bullet0}n_{\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). The phi coefficient can also be expressed using only n , n_{11} , n_{1\bullet} , and n_{\bullet1} , as \varphi = \frac{nn_{11}-n_{1\bullet}n_{\bullet1}}{\sqrt{n_{1\bullet}n_{\bullet1}(n-n_{1\bullet})(n-n_{\bullet1})}}. |\text{MCC}| = \sqrt{\frac{\chi^2}{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. 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{MCC} = \frac{ \mathit{TP} \times \mathit{TN} - \mathit{FP} \times \mathit{FN} } {\sqrt{ (\mathit{TP} + \mathit{FP}) ( \mathit{TP} + \mathit{FN} ) ( \mathit{TN} + \mathit{FP} ) ( \mathit{TN} + \mathit{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: \text{MCC} = \sqrt{\mathit{PPV} \times \mathit{TPR} \times \mathit{TNR} \times \mathit{NPV}} - \sqrt{\mathit{FDR} \times \mathit{FNR} \times \mathit{FPR} \times \mathit{FOR}} 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{align} N &= \mathit{TN} + \mathit{TP} + \mathit{FN} + \mathit{FP} \\[6pt] S &= \frac{ \mathit{TP} + \mathit{FN} } { N } \\[6pt] P &= \frac{ \mathit{TP} + \mathit{FP} } { N } \\[6pt] \text{MCC} &= \frac{ \mathit{TP} / N - S \times P } {\sqrt{ P S ( 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′). Markedness and informedness correspond to different directions of information flow and generalize Youden's J statistic, the \delta p 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. 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: 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 = truepositive; FP = false positive; TN = true negative; FN = false negative. Plugging the numbers from the formula: \text{MCC} = \frac{6 \times 3 - 1 \times 2}{\sqrt{(6 + 1) \times (6 + 2) \times (3 + 1) \times (3 + 2)}} = \frac{16}{\sqrt{1120}} \approx 0.478 \text{MCC} = \frac{\sum_{k}\sum_{l}\sum_{m} C_{kk}C_{lm} - C_{kl}C_{mk}}{ \sqrt{\sum_{k}\left(\sum_l C_{kl}\right)\left(\sum_{k' | k' \neq k}\sum_{l'} C_{k'l'}\right)} \sqrt{\sum_{k}\left(\sum_l C_{lk}\right)\left(\sum_{k' | k' \neq k}\sum_{l'} C_{l'k'}\right)} } When there are more than two classes 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: i is the actual value index j is the predicted value index K is the total number of classes t_k = \sum_i C_{ik} the number of times class k truly occurred, p_k = \sum_j C_{kj} the number of times class k was predicted, c = \sum_{k} C_{kk} the total number of samples correctly predicted, s = \sum_i \sum_j C_{ij} the total number of samples. This allows the formula to be expressed as: \text{MCC} = \frac{cs - \vec{t} \cdot \vec{p}}{ \sqrt{s^2 - \vec{p} \cdot \vec{p}} \sqrt{s^2 - \vec{t} \cdot \vec{t}} } 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{MCC}=\frac{(6+3)\times{\color{green}12}\;-\;{\color{blue}5}\times{\color{brown}4}\;-\;{\color{purple}7}\times{\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}}=\frac{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.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1373684317 under CC BY-SA 4.0; modifications have been made.