An Extensible Linear Approach For Holistic Ontology Matching

Imen Megdiche (1, 2) , Olivier Teste (1, 3) , Cassia Trojahn dos Santos (4, 3)

1 IRIT-SIG - Systèmes d’Informations Généralisées
2 INUC - Institut national universitaire Champollion [Albi]
3 UT2J - Université Toulouse - Jean Jaurès
4 IRIT-MELODI - MEthodes et ingénierie des Langues, des Ontologies et du DIscours

Resolving the semantic heterogeneity in the semantic web requires finding correspondences between ontologies describing resources. In particular, with the explosive growth of data sets in the Linked Open Data, linking multiple vocabularies and ontologies simultaneously, known as holistic matching problem, becomes necessary. Currently, most state-of-the-art matching approaches are limited to pairwise matching. In this paper, we propose a holistic ontology matching approach that is modeled through a linear program extending the maximum-weighted graph matching problem with linear constraints (cardinality, structural, and coherence constraints). Our approach guarantees the optimal solution with mostly coherent alignments. To evaluate our proposal, we discuss the results of experiments performed on the Conference track of the OAEI 2015, under both holistic and pairwise matching settings.

Mots clés: Linear approach; Ontology matching; Holistic matching

Domaines: Théorie de l'information [cs.IT]; Recherche d'information [cs.IR]

Imen Megdiche, Olivier Teste, Cassia Trojahn dos Santos. An Extensible Linear Approach For Holistic Ontology Matching. 15th International Semantic Web Conference (ISWC 2016), Oct 2016, Kobe, Japan. pp. 393-410. ⟨hal-01485007⟩