Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Leveraging Fuzzy Match: Building an Automated Record Linkage Template in SAS Dataflux

View through CrossRef
Background ICES has conducted Probabilistic Record Linkage (PRL) for heath and non-health data for over 15 years. The PRL process has made data linkable to many ICES data holdings. However, due to the manual gray area resolution, record linkages for large datasets are time consuming with inconsistent results. ApproachAdapting from many years of experience with PRL methodology, record linkage templates were built in SAS Dataflux. By using combination of deterministic linkage and fuzzy match algorithms, the multi-pass linkage strategy is maintained by passing unlinked records in subsequent linkage comparison cycles. The new template uses personal identifiers of multiple given names, surnames, date of birth, death date (if applicable) and sex. In each pass, the pool of possible matched pairs is created by merging on low sensitive matchcodes with different conditions. Then, using a rule-based approach, possible pairs are examined, flags are assigned, and survival rules are applied to select the best matched records. ResultsBy feeding a pre-prepared linkage file along with updating the input and output file names, the record linkage job will be conducted automatically in SAS Dataflux through submitting a “run” command. It significantly reduces the turnaround time with no clerical review required, achieves a similar linkage rate as PRL consistently, and is utilized by various research projects. ConclusionThe automated SAS Dataflux record linkage template is more efficient than the traditional PRL process. It eliminates the human intervention of gray area resolution, while reducing project turnaround times, and maintaining a comparable accuracy and linkage rate.
Title: Leveraging Fuzzy Match: Building an Automated Record Linkage Template in SAS Dataflux
Description:
Background ICES has conducted Probabilistic Record Linkage (PRL) for heath and non-health data for over 15 years.
The PRL process has made data linkable to many ICES data holdings.
However, due to the manual gray area resolution, record linkages for large datasets are time consuming with inconsistent results.
ApproachAdapting from many years of experience with PRL methodology, record linkage templates were built in SAS Dataflux.
By using combination of deterministic linkage and fuzzy match algorithms, the multi-pass linkage strategy is maintained by passing unlinked records in subsequent linkage comparison cycles.
The new template uses personal identifiers of multiple given names, surnames, date of birth, death date (if applicable) and sex.
In each pass, the pool of possible matched pairs is created by merging on low sensitive matchcodes with different conditions.
Then, using a rule-based approach, possible pairs are examined, flags are assigned, and survival rules are applied to select the best matched records.
ResultsBy feeding a pre-prepared linkage file along with updating the input and output file names, the record linkage job will be conducted automatically in SAS Dataflux through submitting a “run” command.
It significantly reduces the turnaround time with no clerical review required, achieves a similar linkage rate as PRL consistently, and is utilized by various research projects.
ConclusionThe automated SAS Dataflux record linkage template is more efficient than the traditional PRL process.
It eliminates the human intervention of gray area resolution, while reducing project turnaround times, and maintaining a comparable accuracy and linkage rate.

Related Results

Strategi Dakwah Program Radio SAS FM Surabaya
Strategi Dakwah Program Radio SAS FM Surabaya
Abstrak:     Ada tiga persoalan yang dikaji dalam penelitian ini, yakni : (1) Bagaimana konsep awal terbentuknya radio SAS FM Surabaya, (2) Bagaimana strategi dakwah pada program “...
Konstruksi Sistem Inferensi Fuzzy Menggunakan Subtractive Fuzzy C-Means pada Data Parkinson
Konstruksi Sistem Inferensi Fuzzy Menggunakan Subtractive Fuzzy C-Means pada Data Parkinson
Abstract. Fuzzy Inference System requires several stages to get the output, 1) formation of fuzzy sets, 2) formation of rules, 3) application of implication functions, 4) compositi...
Generated Fuzzy Quasi-ideals in Ternary Semigroups
Generated Fuzzy Quasi-ideals in Ternary Semigroups
Here in this paper, we provide characterizations of fuzzy quasi-ideal in terms of level and strong level subsets. Along with it, we provide expression for the generated fuzzy quasi...
Modernization of Record Linkage At ICES
Modernization of Record Linkage At ICES
IntroductionProbabilistic Record Linkage of large databases requires a substantial amount of time and resources, resulting in significant costs. In addition, the process is subject...
ω – SUBSEMIRING FUZZY
ω – SUBSEMIRING FUZZY
Mapping ρ is called a fuzzy subset of an empty set of S if ρ is the mapping from S to the closed interval [0,1]. A fuzzy subset ρ introduced into this paper is a fuzzy subset of se...
New Approaches of Generalised Fuzzy Soft sets on fuzzy Codes and Its Properties on Decision-Makings
New Approaches of Generalised Fuzzy Soft sets on fuzzy Codes and Its Properties on Decision-Makings
Background Several scholars defined the concepts of fuzzy soft set theory and their application on decision-making problem. Based on this concept, researchers defined the generalis...
New Approaches of Generalised Fuzzy Soft sets on fuzzy Codes and Its Properties on Decision-Makings
New Approaches of Generalised Fuzzy Soft sets on fuzzy Codes and Its Properties on Decision-Makings
Background Several scholars defined the concepts of fuzzy soft set theory and their application on decision-making problem. Based on this concept, researchers defined the generalis...
FUZZY‐FUZZY AUTOMATA
FUZZY‐FUZZY AUTOMATA
Based on the concept of fuzzy sets of type 2 (or fuzzy‐fuzzy sets) defined by L. A. Zadeh, fuzzy‐fuzzy automata ate newly formulated and some properties of these automata are inves...

Back to Top