In statistical analysis of binary classification, the F1 score (also F-score or F-measure) is a measure of a test's accuracy. It considers both the precision p and the recall r of the test to compute the score: p is the number of correct positive results divided by the number of all positive results returned by the classifier, and r is the number of correct positive results divided by the number of all relevant samples (all samples that should have been identified as positive). The F1 score is the harmonic average of the precision and recall, where an F1 score reaches its best value at 1 (perfect precision and recall) and worst at 0.
The name F-measure is believed to be named after a different F function in Van Rijsbergen's book, when introduced to MUC-4. 
This section needs additional citations for verification. (December 2018) (Learn how and when to remove this template message)
The traditional F-measure or balanced F-score (F1 score) is the harmonic mean of precision and recall:
The general formula for positive real β is:
The formula in terms of Type I and type II errors:
Two other commonly used F measures are the measure, which weighs recall higher than precision (by placing more emphasis on false negatives), and the measure, which weighs recall lower than precision (by attenuating the influence of false negatives).
The F-measure was derived so that "measures the effectiveness of retrieval with respect to a user who attaches β times as much importance to recall as precision". It is based on Van Rijsbergen's effectiveness measure
Their relationship is where .
The F1 score is also known as the Sørensen–Dice coefficient or Dice similarity coefficient (DSC).
|Total population||Condition positive||Condition negative||Prevalence = Σ Condition positive/||Accuracy (ACC) = Σ True positive + Σ True negative/|
Type I error
|Positive predictive value (PPV), Precision = Σ True positive/||False discovery rate (FDR) = Σ False positive/|
Type II error
|True negative||False omission rate (FOR) = Σ False negative/||Negative predictive value (NPV) = Σ True negative/|
|True positive rate (TPR), Recall, Sensitivity, probability of detection = Σ True positive/||False positive rate (FPR), Fall-out, probability of false alarm = Σ False positive/||Positive likelihood ratio (LR+) = TPR/||Diagnostic odds ratio (DOR) = LR+/||F1 score = 2/|
|False negative rate (FNR), Miss rate = Σ False negative/||Specificity (SPC), Selectivity, True negative rate (TNR) = Σ True negative/||Negative likelihood ratio (LR−) = FNR/|
The F-score is often used in the field of information retrieval for measuring search, document classification, and query classification performance. Earlier works focused primarily on the F1 score, but with the proliferation of large scale search engines, performance goals changed to place more emphasis on either precision or recall and so is seen in wide application.
The F-score is also used in machine learning. Note, however, that the F-measures do not take the true negatives into account, and that measures such as the Matthews correlation coefficient, Informedness or Cohen's kappa may be preferable to assess the performance of a binary classifier.
David Hand and others criticize the widespread use of the F-score since it gives equal importance to precision and recall. In practice, different types of mis-classifications incur different costs. In other words, the relative importance of precision and recall is an aspect of the problem.
Difference from G-measure
- Matthews correlation coefficient
- NIST (metric)
- Precision and recall
- Receiver operating characteristic
- ROUGE (metric)
- Sørensen–Dice coefficient
- Uncertainty coefficient, aka Proficiency
- Word error rate (WER)
- Sasaki, Y. (2007). "The truth of the F-measure" (PDF).
- Van Rijsbergen, C. J. (1979). Information Retrieval (2nd ed.). Butterworth-Heinemann.
- Powers, David M W (2011). "Evaluation: From Precision, Recall and F-Measure to ROC, Informedness, Markedness & Correlation" (PDF). Journal of Machine Learning Technologies. 2 (1): 37–63.
- Beitzel., Steven M. (2006). On Understanding and Classifying Web Queries (Ph.D. thesis). IIT. CiteSeerX 10.1.1.127.634.
- X. Li; Y.-Y. Wang; A. Acero (July 2008). Learning query intent from regularized click graphs (PDF). Proceedings of the 31st SIGIR Conference.
- See, e.g., the evaluation of the .
- Hand, David. "A note on using the F-measure for evaluating record linkage algorithms - Dimensions". app.dimensions.ai. Retrieved 2018-12-08.