TY - GEN
T1 - Complex matching of RDF datatype properties
AU - Pereira Nunes, Bernardo
AU - Mera, Alexander
AU - Casanova, Marco Antônio
AU - Fetahu, Besnik
AU - Paes Leme, Luiz André P.
AU - Dietze, Stefan
PY - 2013
Y1 - 2013
N2 - Property mapping is a fundamental component of ontology matching, and yet there is little support that goes beyond the identification of single property matches. Real data often requires some degree of composition, trivially exemplified by the mapping of "first name" and "last name" to "full name" on one end, to complex matchings, such as parsing and pairing symbol/digit strings to SSN numbers, at the other end of the spectrum. In this paper, we propose a two-phase instance-based technique for complex datatype property matching. Phase 1 computes the Estimate Mutual Information matrix of the property values to (1) find simple, 1:1 matches, and (2) compute a list of possible complex matches. Phase 2 applies Genetic Programming to the much reduced search space of candidate matches to find complex matches. We conclude with experimental results that illustrate how the technique works. Furthermore, we show that the proposed technique greatly improves results over those obtained if the Estimate Mutual Information matrix or the Genetic Programming techniques were to be used independently.
AB - Property mapping is a fundamental component of ontology matching, and yet there is little support that goes beyond the identification of single property matches. Real data often requires some degree of composition, trivially exemplified by the mapping of "first name" and "last name" to "full name" on one end, to complex matchings, such as parsing and pairing symbol/digit strings to SSN numbers, at the other end of the spectrum. In this paper, we propose a two-phase instance-based technique for complex datatype property matching. Phase 1 computes the Estimate Mutual Information matrix of the property values to (1) find simple, 1:1 matches, and (2) compute a list of possible complex matches. Phase 2 applies Genetic Programming to the much reduced search space of candidate matches to find complex matches. We conclude with experimental results that illustrate how the technique works. Furthermore, we show that the proposed technique greatly improves results over those obtained if the Estimate Mutual Information matrix or the Genetic Programming techniques were to be used independently.
KW - Genetic Programming
KW - Mutual Information
KW - Ontology Matching
KW - Schema Matching
UR - http://www.scopus.com/inward/record.url?scp=84884363947&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-40285-2_18
DO - 10.1007/978-3-642-40285-2_18
M3 - Conference contribution
SN - 9783642402845
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 195
EP - 208
BT - Database and Expert Systems Applications - 24th International Conference, DEXA 2013, Proceedings
T2 - 24th International Conference on Database and Expert Systems Applications, DEXA 2013
Y2 - 26 August 2013 through 29 August 2013
ER -