Automatic Record Linkage using Seeded Nearest Neighbour and Support Vector Machine Classification
The task of linking databases is an important step in an increasing number of data mining projects, because linked data can contain information that is not available otherwise, or that would require time-consuming and expensive collection of specific data. The aim of linking is to match and aggregate all records that refer to the same entity. One of the major challenges when linking large databases is the efficient and accurate classification of record pairs into matches and non-matches. While...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining|
|01_Christen_Automatic_Record_Linkage_using_2008.pdf||53.28 kB||Adobe PDF||Request a copy|
|02_Christen_Automatic_Record_Linkage_using_2008.pdf||357.23 kB||Adobe PDF||Request a copy|
|03_Christen_Automatic_Record_Linkage_using_2008.pdf||99.56 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.