A Generic and Flexible Framework for Selecting Correspondences in Matching and Alignment Problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

A Generic and Flexible Framework for Selecting Correspondences in Matching and Alignment Problems

Fabien Duchateau
Connectez-vous pour contacter l'auteur

Résumé

The Web 2.0 and the inexpensive cost of storage have pushed towards an exponential growth in the volume of collected and produced data. However, the integration of distributed and heterogeneous data sources has become the bottleneck for many applications, and it therefore still largely relies on manual tasks. One of this task, named matching or alignment, is the discovery of correspondences, i.e., semantically-equivalent elements in different data sources. Most approaches which attempt to solve this challenge face the issue of deciding whether a pair of elements is a correspondence or not, given the similarity value(s) computed for this pair. In this paper, we propose a generic and flexible framework for selecting the correspondences by relying on the discriminative similarity values for a pair. Running experiments on a public dataset has demonstrated the im-provment in terms of quality and the robustness for adding new similarity measures without user intervention for tuning.
Fichier principal
Vignette du fichier
duchateau-data13.pdf (200.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01155475 , version 1 (26-05-2015)

Licence

Paternité

Identifiants

  • HAL Id : hal-01155475 , version 1

Citer

Fabien Duchateau. A Generic and Flexible Framework for Selecting Correspondences in Matching and Alignment Problems. 2nd International Conference on Data Management Technologies and Applications (DATA), Jul 2013, Reykjavik, Iceland. pp.129-137. ⟨hal-01155475⟩
273 Consultations
122 Téléchargements

Partager

Gmail Facebook X LinkedIn More