Affiliation:
1. University of Patras, Greece
2. University of Thessaly, Greece
Abstract
Record-linkage is the process of identifying whether two separate records refer to the same real-world entity when some elements of the record’s identifying information (attributes) agree and others disagree. Existing record-linkage decision methodologies use the outcomes from the comparisons of the whole set of attributes. Here, we propose an alternative scheme that assesses the attributes sequentially, allowing for a decision to made at any attribute’s comparison stage, and thus before exhausting all available attributes. The scheme we develop is optimum in that it minimizes a well-defined average cost criterion while the corresponding optimum solution can be easily mapped into a decision tree to facilitate the record-linkage decision process. Experimental results performed in real datasets indicate the superiority of our methodology compared to existing approaches.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems and Management,Information Systems
Reference28 articles.
1. Bhattacharya I. and Getoor L. 2005. Entity resolution in graph data. Tech. rep. CS-TR-4758 Computer Science Department University of Maryland. Bhattacharya I. and Getoor L. 2005. Entity resolution in graph data. Tech. rep. CS-TR-4758 Computer Science Department University of Maryland.
2. Adaptive name matching in information integration
3. Robust and efficient fuzzy match for online data cleaning
4. Data integration using similarity joins and a word-based information representation language
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献