International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 3 | Issue 3 | Year 2012 | Article Id. IJCTT-V3I3P135 | DOI : https://doi.org/10.14445/22312803/IJCTT-V3I3P135

Efficient Techniques for Online Record Linkage

M.V.K.Kumar Varma

Citation :

M.V.K.Kumar Varma, "Efficient Techniques for Online Record Linkage," International Journal of Computer Trends and Technology (IJCTT), vol. 3, no. 3, pp. 518-521, 2012. Crossref, https://doi.org/10.14445/22312803/IJCTT-V3I3P135

Abstract

Matching records that refer to the same entity across databases is becoming an increasingly important part of many data mining projects, as often data from multiple sources needs to be matched in order to enrich data or improve its quality. Record linkage is the computation of the associations among records of multiple databases. It arises in contexts like the integration of such databases, online interactions and negotiations, and many others. Matching data from heterogeneous data source has been a real problem. A great organization must resolve a number of types of heterogeneity problems especially non uniformity problem. Statistical record linkage techniques could be used for resolving this problem but it causes communication bottleneck in a distributed environment. A matching tree is used to overcome communication overhead and give matching decision as obtained using the conventional linkage technique.

Keywords

decision tree, data heterogeneity.

References

[1] A Probabilistic Decision Model for Entity Matching in Heterogeneous Databases," Management Science, vol. 44, no. 10, pp. 1379-1395, 1998.
[2] A Model of Decision Making with Sequential Information Acquisition—Part II," Decision Support Systems, vol. 3, no. 1, pp. 47-72, 1987
[3] Record Linkage: Making Maximum Use of the Discriminating Power of Identifying Information," Comm. ACM, vol. 5, no. 11, pp. 563-566, 1962.