skip to content

A scaling approach to record linkage

Presented by: 
Harvey Goldstein
Tuesday 13th September 2016 - 15:00 to 15:30
INI Seminar Room 1
Co-authors: Mario Cortina-Borja (UCL), Katie Harron (LSHTM)

With increasing availability of large data sets derived from administrative and other sources, there is an increasing demand for the successful linking of these to provide rich sources of data for further analysis. The very large size of such datasets and the variation in the quality of the identifiers used to carry out linkage means that existing approaches based upon ‘probabilistic’ models can make heavy computational demands. They are also based upon questionable assumptions. In this paper we suggest a new approach, based upon a scaling algorithm, that is computationally fast, requires only moderate amounts of storage and has intuitive appeal. A comparison with existing methods is given. 
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