Record Linkage Concepts
slide 1
Record Linkage Concepts
slide 2
Acknowledgements
Slides adapted from training materials developed by CDC—NPCR Faculty:
CDC/Link Plus development and training:
- Kathleen Thoburn
- David Gu
Adapted by:
NPCR National Program of Cancer Registries logo
CDC logo
HHS logo
slide 3
Overview of Record Linkage
- "Record Linkage" aka "Matching" aka "Merge"
- Combining information from a variety of data sources for the same individual
- Merge information from a record in one data source (file 1) with information from another data source (file 2)
- Example: merging cancer information from cancer registry file with death information from vital statistics file
slide 4
Overview of Record Linkage
- Can be accomplished manually, by visually comparing records from two separate sources
- Approach becomes time consuming, tedious, inefficient, and unpractical as the number of records in file 1 and file 2 increases
- Technological advances in computer systems and programming techniques
- Economically feasible to perform computerized record linkage between large files
- Efficient and relatively accurate
slide 5
Duplicate Detection
- Fundamental requirement for accuracy and validity of counts in any disease registry
- Example: National Program of Cancer Registries/ North American Association of Central Cancer Registries standard
- Maintain <= 0.1% (<=1 per 1,000) duplicates
slide 6
Deterministic Matching
- Computerized comparison where EVERYTHING needs to match EXACTLY:
Last Name |
First Name |
Site |
SSN |
DOB |
Sex |
DateDX |
Smith |
John |
C619 |
123654789 |
02011934 |
1 |
06152004 |
Smith |
John |
C619 |
123654789 |
02011934 |
1 |
06152004 |
slide 7
Deterministic Matching
- Often slight variations exist in the data between the two files for the same variables:
Last Name |
First Name |
Site |
SSN |
DOB |
Sex |
DateDX |
Smith |
John |
C619 |
123654789 |
02011934 |
1 |
06152004 |
Smyth |
John |
C619 |
123456786 |
02081934 |
1 |
06102004 |
- Or variables are missing from one of the files:
Last Name |
First Name |
Site |
SSN |
DOB |
Sex |
DateDX |
Smith |
John |
C619 |
123654789 |
02011934 |
1 |
06152004 |
Smith |
John |
C619 |
|
02011934 |
1 |
06152004 |
- These variations would prevent a match from being identified
slide 8
Deterministic Matching / Manual Review
- When we manually review, we use intuition to help us identify positive matches for records containing slight variations in, or missing information for, data between the two files for the same variables
Last Name |
First Name |
Site |
SSN |
DOB |
Sex |
DateDX |
Smith |
John |
C619 |
123654789 |
02011934 |
1 |
06152004 |
Smith |
John |
C619 |
123654786 |
02101934 |
1 |
06152004 |
- Typo in SSN, transposition of digits in the day component of DOB, but would still deem a match
slide 9
Probabilistic Matching
- Translating intuition into formal decision rules
- Use the concept of PROBABILITY and perform PROBABILISTIC matching
- Recommended over traditional deterministic (exact matching) methods when:
- coding errors, reporting variations, missing data or duplicate records
- Estimate probability/likelihood that two records are for the same person versus not
slide 10
Probabilistic Matching
- Find the records in File 2 that seem to match records in File 1
- Calculate a score that indicates, for any pair of records, how likely it is that they both refer to the same person
- Sort the likely and possible matched pairs in order of their scores
- Define a threshold (Cut Off values) for automatically accepting and rejecting a potential link
- Discard unlikely matched pairs (scores below 2nd Cut Off)
- Gray area: range of scores between the two cut off values considered uncertain matches
- Manually review uncertain matches
slide 11
Probabilistic Matching
- The total score for a linkage between any two records is the sum of the scores generated from matching individual fields
- The score assigned to a matching of individual fields is:
- Based on the probability that a matching variable agrees given that a comparison pair is a match
- M Probability - similar to "sensitivity"
- Reduced by the probability that a matching variable agrees given that a comparison pair is not a match
- U Probability - similar to " specificity"
slide 12
Probabilistic Matching
- Agreement argues for linkage
- Disagreement argues against linkage
- Full agreement argues more strongly for linkage than partial agreement
- Some types of partial agreements are stronger than others
- Rare surname versus residence county code
slide 13
Probabilistic Matching
- Agreement on an uncommon value argues more strongly for linkage than a common value
- Agreement on a more specific variable argues more strongly for linkage than agreement on a less specific one
- Agreement on more variables/disagreement on few argues for linkage
slide 14
Probabilistic Matching
- Once comparisons are made, a weight is calculated for each field comparison
- A total weight (or "score") is derived by summing these separate field comparisons across all fields being compared
- Probabilistic weights are
- Field-specific - Birth date versus Sex
- Value-specific - "Jane" versus "Janiqua"
slide 15
Linkage basics
- Blocking variables
- Matching variables
- Advantages of Link Plus
- Using Link Plus
slide 16
Concept of Blocking
- With so many comparisons, large files can make impossible resource demands
- Blocking is an initial probabilistic linkage step that reduces the number of record comparisons between files
- Sort and match the two files by one or more identifying ("blocking") variables
- Comparisons subsequently made only within blocks
- Discard very unlikely record-pairings from the start
slide 17
Graphic - Left image: Pairs of socks that do not match at all.
Middle image: Clothes basket full of socks.
Right image: Pairs of socks that match exactly or almost match.
slide 18
Graphic - Top image: Pair of socks that match exactly.
Middle image: Pair of socks that match almost exactly.
Bottom image: Pair of socks that match in many ways, but not in other ways.
slide 19
Probabilistic linkage concepts (1)
|
Description |
Common usage* |
Blocking |
An initial step to reduce the number of record comparisons and increase efficiency of linkage. At least one blocking variable must match exactly (or phonetically) between the two records being compared; subsequent comparisons are made after blocking. |
Blocking variables:
- Last name
- First name
- Social security number
- Date of birth
|
Matching |
After blocking, matching variables are compared to generate a match score for each record pair.
Match scores for each variable are:
- Field-specific (matching DOB is scored higher than matching sex)
- Value-specific (last name of "Hoopes" is scored higher than "Smith" due to frequency of occurrence)Â
|
Matching variables:
- Last name
- First name
- Social security number
- Date of birth
- Sex
- Address
|
The user may designate matching algorithms & M-probabilities for each variable. |
slide 20
Probabilistic linkage concepts (2)
|
Description |
Common usage* |
Match score |
The total probability weight assigned to each record pair; equal to the sum of scores generated by comparing each match field. Based on software-calculated M probability (sensitivity) and U probability (specificity). |
The range of match scores is examined to determine upper and lower cut-off values. High match scores are likely true matches and scores below cut-off value are automatically designated false matches. Record pairs between cut-off values are clerically reviewed. |
Clerical review |
Case-by-case review of uncertain matches that fall between the upper and lower cut-off values. Additional variables can be added to record layout to assist in the designation of match status. This process can be completed independently by two or more reviewers to increase reliability. |
Additional variables may include:
- Street address
- City, state, zip code
- Suffix
- Race/ethnicity
- Maiden name
|
* May vary based on data items and quality of data in available in matching data sets
|