P4-metric

P₄ metric ^{[1] [2]} (also known as FS or Symmetric F ^[3] ) enables performance evaluation of the binary classifier. It is calculated from precision, recall, specificity and NPV (negative predictive value). P₄ is designed in similar way to F₁ metric, however addressing the criticisms leveled against F₁. It may be perceived as its extension.

Like the other known metrics, P₄ is a function of: TP (true positives), TN (true negatives), FP (false positives), FN (false negatives).

Justification

The key concept of P₄ is to leverage the four key conditional probabilities:

${\displaystyle P(+\mid C{+})}$ - the probability that the sample is positive, provided the classifier result was positive.

${\displaystyle P(C{+}\mid +)}$ - the probability that the classifier result will be positive, provided the sample is positive.

${\displaystyle P(C{-}\mid -)}$ - the probability that the classifier result will be negative, provided the sample is negative.

${\displaystyle P(-\mid C{-})}$ - the probability the sample is negative, provided the classifier result was negative.

The main assumption behind this metric is, that a properly designed binary classifier should give the results for which all the probabilities mentioned above are close to 1. P₄ is designed the way that ${\displaystyle \mathrm {P} _{4}=1}$ requires all the probabilities being equal 1. It also goes to zero when any of these probabilities go to zero.

Definition

P₄ is defined as a harmonic mean of four key conditional probabilities:

${\displaystyle \mathrm {P} _{4}={\frac {4}{{\frac {1}{P(+\mid C{+})}}+{\frac {1}{P(C{+}\mid +)}}+{\frac {1}{P(C{-}\mid -)}}+{\frac {1}{P(-\mid C{-})}}}}={\frac {4}{{\frac {1}{\mathit {precision}}}+{\frac {1}{\mathit {recall}}}+{\frac {1}{\mathit {specificity}}}+{\frac {1}{\mathit {NPV}}}}}}$

In terms of TP,TN,FP,FN it can be calculated as follows:

${\displaystyle \mathrm {P} _{4}={\frac {4\cdot \mathrm {TP} \cdot \mathrm {TN} }{4\cdot \mathrm {TP} \cdot \mathrm {TN} +(\mathrm {TP} +\mathrm {TN} )\cdot (\mathrm {FP} +\mathrm {FN} )}}}$

Evaluation of the binary classifier performance

Evaluating the performance of binary classifier is a multidisciplinary concept. It spans from the evaluation of medical tests, psychiatric tests to machine learning classifiers from a variety of fields. Thus, many metrics in use exist under several names. Some of them being defined independently.

		Predicted condition		Sources: [4] [5] [6] [7] [8] [9] [10] [11] view talk edit
	Total population = P + N	Predicted positive (PP)	Predicted negative (PN)	Informedness, bookmaker informedness (BM) = TPR + TNR − 1	Prevalence threshold (PT) = ⁠√TPR × FPR - FPR/TPR - FPR⁠
Actual condition	Positive (P) [lower-alpha 1]	True positive (TP), hit [lower-alpha 2]	False negative (FN), miss, underestimation	True positive rate (TPR), recall, sensitivity (SEN), probability of detection, hit rate, power = ⁠TP/P⁠= 1 − FNR	False negative rate (FNR), miss rate type II error [lower-alpha 3] = ⁠FN/P⁠= 1 − TPR
	Negative (N) [lower-alpha 4]	False positive (FP), false alarm, overestimation	True negative (TN), correct rejection [lower-alpha 5]	False positive rate (FPR), probability of false alarm, fall-out type I error [lower-alpha 6] = ⁠FP/N⁠= 1 − TNR	True negative rate (TNR), specificity (SPC), selectivity = ⁠TN/N⁠= 1 − FPR
	Prevalence = ⁠P/P + N⁠	Positive predictive value (PPV), precision = ⁠TP/PP⁠= 1 − FDR	False omission rate (FOR) = ⁠FN/PN⁠= 1 − NPV	Positive likelihood ratio (LR+) = ⁠TPR/FPR⁠	Negative likelihood ratio (LR−) = ⁠FNR/TNR⁠
	Accuracy (ACC) = ⁠TP + TN/P + N⁠	False discovery rate (FDR) = ⁠FP/PP⁠= 1 − PPV	Negative predictive value (NPV) = ⁠TN/PN⁠= 1 − FOR	Markedness (MK), deltaP (Δp) = PPV + NPV − 1	Diagnostic odds ratio (DOR) = ⁠LR+/LR−⁠
	Balanced accuracy (BA) = ⁠TPR + TNR/2⁠	F1 score = ⁠2 PPV × TPR/PPV + TPR⁠= ⁠2 TP/2 TP + FP + FN⁠	Fowlkes–Mallows index (FM) = √PPV × TPR	Matthews correlation coefficient (MCC) = √TPR × TNR × PPV × NPV- √FNR × FPR × FOR × FDR	Threat score (TS), critical success index (CSI), Jaccard index = ⁠TP/TP + FN + FP⁠

1. the number of real positive cases in the data
2. A test result that correctly indicates the presence of a condition or characteristic
3. Type II error: A test result which wrongly indicates that a particular condition or attribute is absent
4. the number of real negative cases in the data
5. A test result that correctly indicates the absence of a condition or characteristic
6. Type I error: A test result which wrongly indicates that a particular condition or attribute is present

Properties of P₄ metric

• Symmetry - contrasting to the F₁ metric, P₄ is symmetrical. It means - it does not change its value when dataset labeling is changed - positives named negatives and negatives named positives.
• Range: ${\displaystyle \mathrm {P} _{4}\in [0,1]}$
• Achieving ${\displaystyle \mathrm {P} _{4}\approx 1}$ requires all the key four conditional probabilities being close to 1.
• For ${\displaystyle \mathrm {P} _{4}\approx 0}$ it is sufficient that one of the key four conditional probabilities is close to 0.

Examples, comparing with the other metrics

Dependency table for selected metrics ("true" means depends, "false" - does not depend):

	${\displaystyle P(+\mid C{+})}$	${\displaystyle P(C{+}\mid +)}$	${\displaystyle P(C{-}\mid -)}$	${\displaystyle P(-\mid C{-})}$
P4	true	true	true	true
F1	true	true	false	false
Informedness	false	true	true	false
Markedness	true	false	false	true

Metrics that do not depend on a given probability are prone to misrepresentation when it approaches 0.

Example 1: Rare disease detection test

Let us consider the medical test aimed to detect kind of rare disease. Population size is 100 000, while 0.05% population is infected. Test performance: 95% of all positive individuals are classified correctly (TPR=0.95) and 95% of all negative individuals are classified correctly (TNR=0.95). In such a case, due to high population imbalance, in spite of having high test accuracy (0.95), the probability that an individual who has been classified as positive is in fact positive is very low:

${\displaystyle P(+\mid C{+})=0.0095}$

And now we can observe how this low probability is reflected in some of the metrics:

• ${\displaystyle \mathrm {P} _{4}=0.0370}$
• ${\displaystyle \mathrm {F} _{1}=0.0188}$
• ${\displaystyle \mathrm {J} =\mathbf {0.9100} }$ (Informedness / Youden index)
• ${\displaystyle \mathrm {MK} =0.0095}$ (Markedness)

Example 2: Image recognition - cats vs dogs

We are training neural network based image classifier. We are considering only two types of images: containing dogs (labeled as 0) and containing cats (labeled as 1). Thus, our goal is to distinguish between the cats and dogs. The classifier overpredicts in favor of cats ("positive" samples): 99.99% of cats are classified correctly and only 1% of dogs are classified correctly. The image dataset consists of 100000 images, 90% of which are pictures of cats and 10% are pictures of dogs. In such a situation, the probability that the picture containing dog will be classified correctly is pretty low:

${\displaystyle P(C-|-)=0.01}$

Not all the metrics are noticing this low probability:

• ${\displaystyle \mathrm {P} _{4}=0.0388}$
• ${\displaystyle \mathrm {F} _{1}=\mathbf {0.9478} }$
• ${\displaystyle \mathrm {J} =0.0099}$ (Informedness / Youden index)
• ${\displaystyle \mathrm {MK} =\mathbf {0.8183} }$ (Markedness)

See also

• F-score
• Informedness
• Markedness
• Matthews correlation coefficient
• Precision and Recall
• Sensitivity and Specificity
• NPV
• Confusion matrix

References

1. Sitarz, Mikolaj (2023). "Extending F1 Metric, Probabilistic Approach". Advances in Artificial Intelligence and Machine Learning. 03 (2): 1025–1038. arXiv: 2210.11997 . doi:10.54364/AAIML.2023.1161.
2. "P4 metric, a new way to evaluate binary classifiers".
3. Hand, David J.; Christen, Peter; Ziyad, Sumayya (2024). "Selecting a classification performance measure: Matching the measure to the problem". arXiv: 2409.12391 [cs.LG].
4. Fawcett, Tom (2006). "An Introduction to ROC Analysis" (PDF). Pattern Recognition Letters. 27 (8): 861–874. doi:10.1016/j.patrec.2005.10.010. S2CID   2027090.
5. Provost, Foster; Tom Fawcett (2013-08-01). "Data Science for Business: What You Need to Know about Data Mining and Data-Analytic Thinking". O'Reilly Media, Inc.
6. Powers, David M. W. (2011). "Evaluation: From Precision, Recall and F-Measure to ROC, Informedness, Markedness & Correlation". Journal of Machine Learning Technologies. 2 (1): 37–63.
7. Ting, Kai Ming (2011). Sammut, Claude; Webb, Geoffrey I. (eds.). Encyclopedia of machine learning. Springer. doi:10.1007/978-0-387-30164-8. ISBN   978-0-387-30164-8.
8. Brooks, Harold; Brown, Barb; Ebert, Beth; Ferro, Chris; Jolliffe, Ian; Koh, Tieh-Yong; Roebber, Paul; Stephenson, David (2015-01-26). "WWRP/WGNE Joint Working Group on Forecast Verification Research". Collaboration for Australian Weather and Climate Research. World Meteorological Organisation. Retrieved 2019-07-17.
9. Chicco D, Jurman G (January 2020). "The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation". BMC Genomics. 21 (1): 6-1–6-13. doi: 10.1186/s12864-019-6413-7 . PMC   6941312 . PMID   31898477.
10. Chicco D, Toetsch N, Jurman G (February 2021). "The Matthews correlation coefficient (MCC) is more reliable than balanced accuracy, bookmaker informedness, and markedness in two-class confusion matrix evaluation". BioData Mining. 14 (13): 13. doi: 10.1186/s13040-021-00244-z . PMC   7863449 . PMID   33541410.
11. Tharwat A. (August 2018). "Classification assessment methods". Applied Computing and Informatics. 17: 168–192. doi: 10.1016/j.aci.2018.08.003 .