F1 score

From formulasearchengine
Jump to navigation Jump to search

{{#invoke:Hatnote|hatnote}}Template:Main other 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, and r is the number of correct positive results divided by the number of positive results that should have been returned. The F1 score can be interpreted as a weighted average of the precision and recall, where an F1 score reaches its best value at 1 and worst score at 0.

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 weights recall higher than precision, and the measure, which puts more emphasis on precision than recall.

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".[1] It is based on Van Rijsbergen's effectiveness measure

.

Their relationship is where .

Diagnostic Testing

This is related to the field of binary classification where recall is often termed as Sensitivity. There are several reasons that the F1 score can be criticized in particular circumstances.[2]

Template:DiagnosticTesting Diagram

Applications

The F-score is often used in the field of information retrieval for measuring search, document classification, and query classification performance.[3] 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[4] and so is seen in wide application.

The F-score is also used in machine learning.[5] Note, however, that the F-measures do not take the true negative rate into account, and that measures such as the Phi coefficient, Matthews correlation coefficient, Informedness or Cohen's kappa may be preferable to assess the performance of a binary classifier.[2]

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

G-measure

While the F-measure is the harmonic mean of Recall and Precision, the G-measure is the geometric mean.[2]

.

See also

References

  1. {{#invoke:citation/CS1|citation |CitationClass=book }}
  2. 2.0 2.1 2.2 {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  3. Template:Cite thesis
  4. {{#invoke:citation/CS1|citation |CitationClass=conference }}
  5. See, e.g., the evaluation of the CoNLL 2002 shared task.

de:Beurteilung eines Klassifikators#Kombinierte Maße