Learning to match and cluster large high-dimensional data sets for data integration

Part of the process of data integration is determining which sets of identifiers refer to the same real-world entities. In integrating databases found on the Web or obtained by using information extraction methods, it is often possible to solve this problem by exploiting similarities in the textual names used for objects in different databases. In this paper we describe techniques for clustering and matching identifier names that are both scalable and adaptive, in the sense that they can be trained to obtain better performance in a particular domain. An experimental evaluation on a number of sample datasets shows that the adaptive method sometimes performs much better than either of two non-adaptive baseline systems, and is nearly always competitive with the best baseline system.

[1]  William W. Cohen,et al.  Learning to Match and Cluster Entity Names , 2001 .

[2]  Tom M. Mitchell,et al.  Learning to Extract Symbolic Knowledge from the World Wide Web , 1998, AAAI/IAAI.

[3]  Andrew McCallum,et al.  Efficient clustering of high-dimensional data sets with application to reference matching , 2000, KDD '00.

[4]  William W. Cohen Reasoning about Textual Similarity in a Web-Based Information Access System , 2004, Autonomous Agents and Multi-Agent Systems.

[5]  H B NEWCOMBE,et al.  Automatic linkage of vital records. , 1959, Science.

[6]  William E. Winkler,et al.  The State of Record Linkage and Current Research Problems , 1999 .

[7]  Gerald Salton,et al.  Automatic text processing , 1988 .

[8]  William W. Cohen Data integration using similarity joins and a word-based information representation language , 2000, TOIS.

[9]  Yoram Singer,et al.  Learning to Order Things , 1997, NIPS.

[10]  Andrew McCallum,et al.  Using Maximum Entropy for Text Classification , 1999 .

[11]  Ivan P. Fellegi,et al.  A Theory for Record Linkage , 1969 .

[12]  William W. Cohen WHIRL: A word-based information representation language , 2000, Artif. Intell..

[13]  W. Winkler IMPROVED DECISION RULES IN THE FELLEGI-SUNTER MODEL OF RECORD LINKAGE , 1993 .

[14]  Charles Elkan,et al.  The Field Matching Problem: Algorithms and Applications , 1996, KDD.

[15]  P. Ivax,et al.  A THEORY FOR RECORD LINKAGE , 2004 .

[16]  C. Lee Giles,et al.  Digital Libraries and Autonomous Citation Indexing , 1999, Computer.

[17]  Matching algorithm , 1996 .

[18]  Andrew McCallum,et al.  Automating the Construction of Internet Portals with Machine Learning , 2000, Information Retrieval.

[19]  Dennis Shasha,et al.  AJAX: an extensible data cleaning tool , 2000, SIGMOD '00.

[20]  Salvatore J. Stolfo,et al.  The merge/purge problem for large databases , 1995, SIGMOD '95.