Record linkage is an important problem in all data integration contexts t hat assume to be valid the hypothesis of data sources. In this paper we formulate the record linkage problem as a inultiobjective optimization problem and we propose an algorithm for solving it based 011 evolutionary computation. This computational paradigm has a stoc hastic, adaptive and intrinsically parallel nature that makes it particularly suitable for 011-the-fly data integration contexts.
EARL: an Evolutionary Algorithm for Record Linkage / Francesco, Cusmai; Aiello, Carola; Monica, Scannapieco; Catarci, Tiziana. - WP 08:02(2008), pp. 23-32. (Intervento presentato al convegno 6th International Workshop on Quality in Databases, QDB 2008 and 3rd Workshop on Management of Uncertain Data, MUD 2008 tenutosi a Auckland; New Zealand nel 25 Agosto 2008).
EARL: an Evolutionary Algorithm for Record Linkage
AIELLO, Carola;CATARCI, Tiziana
2008
Abstract
Record linkage is an important problem in all data integration contexts t hat assume to be valid the hypothesis of data sources. In this paper we formulate the record linkage problem as a inultiobjective optimization problem and we propose an algorithm for solving it based 011 evolutionary computation. This computational paradigm has a stoc hastic, adaptive and intrinsically parallel nature that makes it particularly suitable for 011-the-fly data integration contexts.| File | Dimensione | Formato | |
|---|---|---|---|
|
VE_2008_11573-368217.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
173.56 kB
Formato
Adobe PDF
|
173.56 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
