An Experiment with Hierarchical Bayesian Record Linkage

12/20/2012
by   Michael D. Larsen, et al.
0

In record linkage (RL), or exact file matching, the goal is to identify the links between entities with information on two or more files. RL is an important activity in areas including counting the population, enhancing survey frames and data, and conducting epidemiological and follow-up studies. RL is challenging when files are very large, no accurate personal identification (ID) number is present on all files for all units, and some information is recorded with error. Without an unique ID number one must rely on comparisons of names, addresses, dates, and other information to find the links. Latent class models can be used to automatically score the value of information for determining match status. Data for fitting models come from comparisons made within groups of units that pass initial file blocking requirements. Data distributions can vary across blocks. This article examines the use of prior information and hierarchical latent class models in the context of RL.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/10/2023

Bayesian Record Linkage with Variables in One File

In many healthcare and social science applications, information about un...
research
07/13/2023

Fast Bayesian Record Linkage for Streaming Data Contexts

Record linkage is the task of combining records from multiple files whic...
research
05/18/2020

A Bayesian Multi-Layered Record Linkage Procedure to Analyze Functional Status of Medicare Patients with Traumatic Brain Injury

Understanding the association between injury severity and patients' pote...
research
06/01/2023

A General Framework for Regression with Mismatched Data Based on Mixture Modeling

Data sets obtained from linking multiple files are frequently affected b...
research
07/07/2021

How Big Are Peoples' Computer Files? File Size Distributions Among User-managed Collections

Improving file management interfaces and optimising system performance r...
research
12/12/2017

Hierarchical Bloom Filter Trees for Approximate Matching

Bytewise approximate matching algorithms have in recent years shown sign...

Please sign up or login with your details

Forgot password? Click here to reset