The Community for Technology Leaders
Green Image
Issue No. 04 - April (2010 vol. 22)
ISSN: 1041-4347
pp: 578-589
Weifeng Su , BNU-HKBU United International College and PKU-HKUST Shenzhen Hong Kong Institution, China
Jiying Wang , City University of Hong Kong, Hong Kong
Frederick H. Lochovsky , The Hong Kong University of Science and Technology, Hong Kong
Record matching, which identifies the records that represent the same real-world entity, is an important step for data integration. Most state-of-the-art record matching methods are supervised, which requires the user to provide training data. These methods are not applicable for the Web database scenario, where the records to match are query results dynamically generated on-the-fly. Such records are query-dependent and a prelearned method using training examples from previous query results may fail on the results of a new query. To address the problem of record matching in the Web database scenario, we present an unsupervised, online record matching method, UDD, which, for a given query, can effectively identify duplicates from the query result records of multiple Web databases. After removal of the same-source duplicates, the “presumed” nonduplicate records from the same source can be used as training examples alleviating the burden of users having to manually label training examples. Starting from the nonduplicate set, we use two cooperating classifiers, a weighted component similarity summing classifier and an SVM classifier, to iteratively identify duplicates in the query results from multiple Web databases. Experimental results show that UDD works well for the Web database scenario where existing supervised methods do not apply.
Record matching, duplicate detection, record linkage, data deduplication, data integration, Web database, query result record, SVM.

F. H. Lochovsky, J. Wang and W. Su, "Record Matching over Query Results from Multiple Web Databases," in IEEE Transactions on Knowledge & Data Engineering, vol. 22, no. , pp. 578-589, 2009.
95 ms
(Ver 3.3 (11022016))