@inproceedings{97f7d70bad8b420fb975bbcb11f42e16,
title = "Making sense of top-k matchings: A unified match graph for schema matching",
abstract = "Schema matching in uncertain environments faces several challenges, among them the identification of complex correspondences. In this paper, we present a method to address this challenge based on top-k matchings, i.e., a set of matchings comprising only 1: 1 correspondences derived by common matchers. We propose the unified top-k match graph and define a clustering problem for it. The obtained attribute clusters are analysed to derive complex correspondences. Our experimental evaluation shows that our approach is able to identify a significant share of complex correspondences.",
keywords = "complex correspondences, graph modularity, schema matching, top-k matching",
author = "Avigdor Gal and Tomer Sagi and Matthias Weidlich and Eliezer Levy and Victor Shafran and Zolt{\'a}n Mikl{\'o}s and Hung, \{Nguyen Quoc Viet\}",
year = "2012",
doi = "10.1145/2331801.2331807",
language = "الإنجليزيّة",
isbn = "9781450312394",
series = "ACM International Conference Proceeding Series",
booktitle = "Proceedings of the 9th International Workshop on Information Integration on the Web, IIWeb'12",
note = "9th International Workshop on Information Integration on the Web, IIWeb'12 ; Conference date: 20-05-2012 Through 20-05-2012",
}