Evaluation of two heuristic approaches to solve the ontology meta-matching problem

Jorge Martinez-Gil (1) , José F. Aldana-Montes (2)

1 SCCH - Software Competence Center Hagenberg
2 Universidad de Málaga [Málaga] = University of Málaga [Málaga]

Nowadays many techniques and tools are available for addressing the ontology matching problem, however, the complex nature of this problem causes existing solutions to be unsatisfactory. This work aims to shed some light on a more flexible way of matching ontologies. Ontology meta-matching, which is a set of techniques to configure optimum ontology matching functions. In this sense, we propose two approaches to automatically solve the ontology meta-matching problem. The first one is called maximum similarity measure, which is based on a greedy strategy to compute efficiently the parameters which configure a composite matching algorithm. The second approach is called genetics for ontology alignments and is based on a genetic algorithm which scales better for a large number of atomic matching algorithms in the composite algorithm and is able to optimize the results of the matching process.

Mots clés: Information integration; Ontology meta-matching; Knowledge management; Ontology Alignment

Domaines: Informatique [cs]

Jorge Martinez-Gil, José F. Aldana-Montes. Evaluation of two heuristic approaches to solve the ontology meta-matching problem. Knowledge and Information Systems (KAIS), 2011, 26 (2), pp.225-247. ⟨10.1007/s10115-009-0277-0⟩. ⟨hal-01673297⟩