Abstract
Ontology presents a field knowledge by defining the meaning of domain concepts and relations among them. To conduct the inter-operability between two heterogeneous ontologies, we need to determine a number of entity correspondences, the so-called Ontology Matching (OM). Traditional OM techniques dedicate to find the simple correspondences which cannot sufficiently express the diverse kinds of heterogeneity, and therefore, complex correspondences are required, which maps one or multiple entities from one ontology to those from the other. Due to the semantic complexity, automatically discovering large-scale simple and complex correspondences has become a challenge. To face this challenge, in this work, an Anchor-based Semantic Partitioning Technique (ASPT) is first presented to divide the large-scale ontologies into several semantic segments, whose computational complexity is lower than the existing ontology partitioning algorithms. Then, a Pattern-based Similarity Measure (PSM) is used to distinguish both simple and complex correspondences. Finally, a Confidence Matrix based Evolutionary Algorithm (CM-EA) is proposed to efficiently match the ontology segments. We compare our proposal with EA-based matching technique and state-of-the-art ontology matching systems on OAEI’s Complex track, and the experimental results show that our approach is able to efficiently match large-scale complex ontologies.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call