Approximate string-matching with q-grams and maximal matches
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Approximate String Joins in a Database (Almost) for Free
Proceedings of the 27th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
Record or data linkage techniques are used to link records which represent the same entity (e.g. patient, customer, citation, etc.) in one or more data sets where a unique identifier for each entity is not available in all or any of the data sets to be linked. A data set that has undergone record linkage is said to be linked. We consider the problem of discovering subsequent patient visit records in a high volume Out Patient Department (OPD), which due to various reasons (including loss of patient ID card and lack of time in ascertaining link to prior visit) is recorded as individual visits. We present a solution to this problem by adapting record linkage techniques that are typically used for identifying duplicate records. An experimental study conducted on real data obtained from a hospital's Out Patient Department demonstrates the effectiveness of our scheme.