We solve the problem of record linkage between databases where record fields are mixed and permuted in different ways. The solution method uses a conditional random fields model to find matching terms in record pairs and uses matching terms in the duplicate detection process. Although records with permuted fields may have partly reordered terms, our method can still utilize local orders of terms for finding matching terms. We carried out experiments on several well-known data sets in record linkage research, and our method showed its advantages on most of the data sets. We also did experiments on a synthetic data set, in which records combined fields in random order, and verified that it could handle even this data set. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Vu, Q. M., Takasu, A., & Adachi, J. (2009). A versatile record linkage method by term matching model using CRF. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5690 LNCS, pp. 547–560). https://doi.org/10.1007/978-3-642-03573-9_46
Mendeley helps you to discover research relevant for your work.