An Extensible Linear Approach For Holistic Ontology Matching

Abstract : 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.
Complete list of metadatas
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Wednesday, March 8, 2017 - 10:02:10 AM
Last modification on : Thursday, June 27, 2019 - 4:27:51 PM
Long-term archiving on : Friday, June 9, 2017 - 12:53:26 PM


Files produced by the author(s)


  • HAL Id : hal-01485007, version 1
  • OATAO : 17170



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



Record views


Files downloads