TY - GEN
T1 - Making sense of top-k matchings
T2 - 9th International Workshop on Information Integration on the Web, IIWeb'12
AU - Gal, Avigdor
AU - Sagi, Tomer
AU - Weidlich, Matthias
AU - Levy, Eliezer
AU - Shafran, Victor
AU - Miklós, Zoltán
AU - Hung, Nguyen Quoc Viet
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
KW - complex correspondences
KW - graph modularity
KW - schema matching
KW - top-k matching
UR - http://www.scopus.com/inward/record.url?scp=84864987279&partnerID=8YFLogxK
U2 - 10.1145/2331801.2331807
DO - 10.1145/2331801.2331807
M3 - Conference contribution
AN - SCOPUS:84864987279
SN - 9781450312394
T3 - ACM International Conference Proceeding Series
BT - Proceedings of the 9th International Workshop on Information Integration on the Web, IIWeb'12
Y2 - 20 May 2012 through 20 May 2012
ER -