skip to content

A note on the F-measure for evaluating record linkage algorithms (and classification methods and information retrieval systems)

Presented by: 
David Hand Imperial College London
Peter Christen Australian National University, Australian National University
Thursday 8th September 2016 - 15:30 to 16:30
INI Seminar Room 2
Record linkage is the process of identifying and linking records about the same entities from one more databases. If applied on a single database the process is known as deduplication. Record linkage can be viewed as a classification problem where the aim is to decide if a pair of records is a match (the two records refer to the same real-world entity) or a non-match (the two records refer to two different entities). Various classification techniques – including supervised, unsupervised, semi-supervised and active learning based – have been employed for record linkage. If ground truth data in the form of known true matches and non-matches are available, the quality of classified links can be evaluated. Due to the generally high class imbalance in record linkage problems, standard accuracy or misclassification rate are not meaningful for assessing the quality of a set of linked records. Instead, precision and recall, as commonly used in information retrieval, are used. These are often combined into the popular F-measure, which is normally presented as the harmonic mean of precision and recall. We show that F-measure can be expressed as a weighted sum of precision and recall, with weights which depend on the linkage method being used. This reformulation reveals the measure to have a major conceptual weakness: the relative importance assigned to precision and recall should be an aspect of the problem and the user, but not of the particular instrument being used. We suggest alternative measures which do not suffer from this fundamental flaw.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons