In statistical analysis of binary classification and information retrieval systems, the F-score or F-measure is a measure of predictive performance. It is calculated from the precision and recall of the test, where the precision is the number of true positive results divided by the number of all samples predicted to be positive, including those not identified correctly, and the recall is the number of true positive results divided by the number of all samples that should have been identified as positive. Precision is also known as positive predictive value, and recall is also known as sensitivity in diagnostic binary classification.

The F₁ score is the harmonic mean of the precision and recall. It thus symmetrically represents both precision and recall in one metric. The more generic ${\displaystyle F_{\beta }}$ score applies additional weights, valuing one of precision or recall more than the other.

The highest possible value of an F-score is 1.0, indicating perfect precision and recall, and the lowest possible value is 0, if precision and recall are zero.

The name F-measure is believed to be named after a different F function in Van Rijsbergen's book, when introduced to the Fourth Message Understanding Conference (MUC-4, 1992).^[1]

The traditional F-measure or balanced F-score (F₁ score) is the harmonic mean of precision and recall:^[2]

${\displaystyle F_{1}={\frac {2}{\mathrm {recall} ^{-1}+\mathrm {precision} ^{-1}}}=2{\frac {\mathrm {precision} \cdot \mathrm {recall} }{\mathrm {precision} +\mathrm {recall} }}={\frac {2\mathrm {TP} }{2\mathrm {TP} +\mathrm {FP} +\mathrm {FN} }}}$.

A more general F score, ${\displaystyle F_{\beta }}$, that uses a positive real factor ${\displaystyle \beta }$, where ${\displaystyle \beta }$ is chosen such that recall is considered ${\displaystyle \beta }$ times as important as precision, is:

${\displaystyle F_{\beta }=(1+\beta ^{2})\cdot {\frac {\mathrm {precision} \cdot \mathrm {recall} }{(\beta ^{2}\cdot \mathrm {precision} )+\mathrm {recall} }}}$.

In terms of Type I and type II errors this becomes:

${\displaystyle F_{\beta }={\frac {(1+\beta ^{2})\cdot \mathrm {true\ positive} }{(1+\beta ^{2})\cdot \mathrm {true\ positive} +\beta ^{2}\cdot \mathrm {false\ negative} +\mathrm {false\ positive} }}\,}$.

Two commonly used values for ${\displaystyle \beta }$ are 2, which weighs recall higher than precision, and 0.5, which weighs recall lower than precision.

The F-measure was derived so that ${\displaystyle F_{\beta }}$ "measures the effectiveness of retrieval with respect to a user who attaches ${\displaystyle \beta }$ times as much importance to recall as precision".^[3] It is based on Van Rijsbergen's effectiveness measure

${\displaystyle E=1-\left({\frac {\alpha }{p}}+{\frac {1-\alpha }{r}}\right)^{-1}}$.

Their relationship is ${\displaystyle F_{\beta }=1-E}$ where ${\displaystyle \alpha ={\frac {1}{1+\beta ^{2}}}}$.

This is related to the field of binary classification where recall is often termed "sensitivity".

Precision-recall curve, and thus the ${\displaystyle F_{\beta }}$ score, explicitly depends on the ratio ${\displaystyle r}$ of positive to negative test cases.^[12] This means that comparison of the F-score across different problems with differing class ratios is problematic. One way to address this issue (see e.g., Siblini et al., 2020^[13] ) is to use a standard class ratio ${\displaystyle r_{0}}$ when making such comparisons.

The F-score is often used in the field of information retrieval for measuring search, document classification, and query classification performance.^[14] It is particularly relevant in applications which are primarily concerned with the positive class and where the positive class is rare relative to the negative class.

Earlier works focused primarily on the F₁ score, but with the proliferation of large scale search engines, performance goals changed to place more emphasis on either precision or recall^[15] and so ${\displaystyle F_{\beta }}$ is seen in wide application.

The F-score is also used in machine learning.^[16] However, the F-measures do not take true negatives into account, hence measures such as the Matthews correlation coefficient, Informedness or Cohen's kappa may be preferred to assess the performance of a binary classifier.^[17]

The F-score has been widely used in the natural language processing literature,^[18] such as in the evaluation of named entity recognition and word segmentation.

The F₁ score is the Dice coefficient of the set of retrieved items and the set of relevant items.^[19]

• The F₁-score of a classifier which always predicts the positive class converges to 1 as the probability of the positive class increases.
• The F₁-score of a classifier which always predicts the positive class is equal to 2 * proportion_of_positive_class / ( 1 + proportion_of_positive_class ), since the recall is 1, and the precision is equal to the proportion of the positive class.^[20]
• If the scoring model is uninformative (cannot distinguish between the positive and negative class) then the optimal threshold is 0 so that the positive class is always predicted.
• F₁ score is concave in the true positive rate.^[21]

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.^[22]

According to Davide Chicco and Giuseppe Jurman, the F₁ score is less truthful and informative than the Matthews correlation coefficient (MCC) in binary evaluation classification.^[23]

David M W Powers has pointed out that F₁ ignores the True Negatives and thus is misleading for unbalanced classes, while kappa and correlation measures are symmetric and assess both directions of predictability - the classifier predicting the true class and the true class predicting the classifier prediction, proposing separate multiclass measures Informedness and Markedness for the two directions, noting that their geometric mean is correlation.^[24]

Another source of critique of F₁ is its lack of symmetry. It means it may change its value when dataset labeling is changed - the "positive" samples are named "negative" and vice versa. This criticism is met by the P4 metric definition, which is sometimes indicated as a symmetrical extension of F₁.^[25]

While the F-measure is the harmonic mean of recall and precision, the Fowlkes–Mallows index is their geometric mean.^[26]

The F-score is also used for evaluating classification problems with more than two classes (Multiclass classification). A common method is to average the F-score over each class, aiming at a balanced measurement of performance.^[27]

Macro F1 is a macro-averaged F1 score aiming at a balanced performance measurement. To calculate macro F1, two different averaging-formulas have been used: the F1 score of (arithmetic) class-wise precision and recall means or the arithmetic mean of class-wise F1 scores, where the latter exhibits more desirable properties.^[28]

Micro F1 is the harmonic mean of micro precision (number of correct predictions normalized by false positives) and micro recall (number of correct predictions normalized by false negatives). Since in multi-class evaluation the overall amount of false positives equals the amount of false negatives, micro F1 is equivalent to Accuracy.^[27]

• BLEU
• Confusion matrix
• Hypothesis tests for accuracy
• METEOR
• NIST (metric)
• Receiver operating characteristic
• ROUGE (metric)
• Uncertainty coefficient, aka Proficiency
• Word error rate
• LEPOR