KEYWORDS:
Registry master patient index; match algorithms
BACKGROUND:
An efficient strategy for matching immunization registry records is critical to optimizing its linkages with other databases. Immunization registries have great potential for interfacing with community-based databases, but only if the records can be matched.
OBJECTIVE(S):
Compare algorithms for matching records for children identified through community based programs with records in a practice network immunization registry.
METHOD(S):
In April 2002, we searched for immunization registry records for 1,082 children <5 years old had enrolled in a community immunization outreach program. The three identifiers were child's first and last name and date of birth. Based on these two parameters we created hierarchical algorithms that systematically allowed for discrepancies between the identifiers in the two databases. Matches were classified as possible, probable, or exact. Manual verification was used to determine if possible matches were probable.
RESULT(S):
196 records (18% of 1082) had an exact match. The least restrictive algorithm (allows 3 day birthdate window and a two-letter partial name match) yielded 5,967 possible matches for 820 records. 7.3 possible matches were reviewed per record, of which 184 (17% of 1082) were verified as probable matches. The hierarchical algorithm of staged applications of the different windows of the identifiers yielded 176 probable matches (96% of 184), but only required manual verification of 1057 possible matches for 657 records. (1.6 possible matches per record).
CONCLUSIONS(S):
Application of a hierarchical matching algorithm is a more efficient search strategy for matching patient records in different databases.
LEARNING OBJECTIVES:
Compare hierarchical matching algorithms for linking registry records.
Back to Grow: Technical Challenges and Innovations — Part II
Back to Contributed Papers
Back to The 2002 Immunization Registry Conference of CDC