Improving Ontology Matching Using Application Requirements for Segmenting Ontologies

Ontology matching is concerned with finding relations between elements of different ontologies. In large-scale settings, some significant challenges arise, such as how to achieve a reduction in the time it takes to perform matching and how to improve the quality of results. Current techniques involv...

Full description

Bibliographic Details
Main Authors: Diego Pessoa, Ana Salgado, Bernadette Lóscio
Format: Article
Language:English
Published: Graz University of Technology 2019-07-01
Series:Journal of Universal Computer Science
Subjects:
Online Access:https://lib.jucs.org/article/22632/download/pdf/
id doaj-838f527b0e4e402e8b8d03d8345f177c
record_format Article
spelling doaj-838f527b0e4e402e8b8d03d8345f177c2021-06-23T07:57:21ZengGraz University of TechnologyJournal of Universal Computer Science0948-69682019-07-0125781683910.3217/jucs-025-07-081622632Improving Ontology Matching Using Application Requirements for Segmenting OntologiesDiego Pessoa0Ana Salgado1Bernadette Lóscio2Federal University of Pernambuco (UFPE)Federal University of Pernambuco (UFPE)Federal University of Pernambuco (UFPE)Ontology matching is concerned with finding relations between elements of different ontologies. In large-scale settings, some significant challenges arise, such as how to achieve a reduction in the time it takes to perform matching and how to improve the quality of results. Current techniques involve the use of ontology segmentation to overcome having such a large number of elements to compare. However, current methods usually select the most relevant ontology elements based on the number of relationships, which may dismiss some elements should they have fewer or no relationships. Therefore, we propose an algorithm for ontology segmentation based on application requirements, in such a way that the users can specify the concepts that are the most relevant in their application context to generate the segments which will be used as an input for the matching. In the experiments, we found a general reduction in the execution time and some significant quality improvements, depending on what matcher is applied. In order to assess the proposed algorithm, we considered some well-known evaluation measures, such as precision, recall, and F-Measure.https://lib.jucs.org/article/22632/download/pdf/segmented-based ontology matchingontology segmen
collection DOAJ
language English
format Article
sources DOAJ
author Diego Pessoa
Ana Salgado
Bernadette Lóscio
spellingShingle Diego Pessoa
Ana Salgado
Bernadette Lóscio
Improving Ontology Matching Using Application Requirements for Segmenting Ontologies
Journal of Universal Computer Science
segmented-based ontology matching
ontology segmen
author_facet Diego Pessoa
Ana Salgado
Bernadette Lóscio
author_sort Diego Pessoa
title Improving Ontology Matching Using Application Requirements for Segmenting Ontologies
title_short Improving Ontology Matching Using Application Requirements for Segmenting Ontologies
title_full Improving Ontology Matching Using Application Requirements for Segmenting Ontologies
title_fullStr Improving Ontology Matching Using Application Requirements for Segmenting Ontologies
title_full_unstemmed Improving Ontology Matching Using Application Requirements for Segmenting Ontologies
title_sort improving ontology matching using application requirements for segmenting ontologies
publisher Graz University of Technology
series Journal of Universal Computer Science
issn 0948-6968
publishDate 2019-07-01
description Ontology matching is concerned with finding relations between elements of different ontologies. In large-scale settings, some significant challenges arise, such as how to achieve a reduction in the time it takes to perform matching and how to improve the quality of results. Current techniques involve the use of ontology segmentation to overcome having such a large number of elements to compare. However, current methods usually select the most relevant ontology elements based on the number of relationships, which may dismiss some elements should they have fewer or no relationships. Therefore, we propose an algorithm for ontology segmentation based on application requirements, in such a way that the users can specify the concepts that are the most relevant in their application context to generate the segments which will be used as an input for the matching. In the experiments, we found a general reduction in the execution time and some significant quality improvements, depending on what matcher is applied. In order to assess the proposed algorithm, we considered some well-known evaluation measures, such as precision, recall, and F-Measure.
topic segmented-based ontology matching
ontology segmen
url https://lib.jucs.org/article/22632/download/pdf/
work_keys_str_mv AT diegopessoa improvingontologymatchingusingapplicationrequirementsforsegmentingontologies
AT anasalgado improvingontologymatchingusingapplicationrequirementsforsegmentingontologies
AT bernadetteloscio improvingontologymatchingusingapplicationrequirementsforsegmentingontologies
_version_ 1721362397284794368