Next Article in Journal
Multiple Congestion Points and Congestion Reaction Mechanisms for Improving DCTCP Performance in Data Center Networks
Previous Article in Journal
A Novel Method for Determining the Attribute Weights in the Multiple Attribute Decision-Making with Neutrosophic Information through Maximizing the Generalized Single-Valued Neutrosophic Deviation
Article Menu

Export Article

Open AccessArticle
Information 2018, 9(6), 138; https://doi.org/10.3390/info9060138

Automatically Specifying a Parallel Composition of Matchers in Ontology Matching Process by Using Genetic Algorithm

1
Faculty of Maritime Studies, University of Rijeka, Studentska ulica 2, 51000 Rijeka, Croatia
2
Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000 Zagreb, Croatia
*
Author to whom correspondence should be addressed.
Received: 25 April 2018 / Revised: 5 June 2018 / Accepted: 6 June 2018 / Published: 7 June 2018
(This article belongs to the Section Information Systems)
Full-Text   |   PDF [2935 KB, uploaded 8 June 2018]   |  

Abstract

Today, there is a rapid increase of the available data because of advances in information and communications technology. Therefore, many mutually heterogeneous data sources that describe the same domain of interest exist. To facilitate the integration of these heterogeneous data sources, an ontology can be used as it enriches the knowledge of a data source by giving a detailed description of entities and their mutual relations within the domain of interest. Ontology matching is a key issue in integrating heterogeneous data sources described by ontologies as it eases the management of data coming from various sources. The ontology matching system consists of several basic matchers. To determine high-quality correspondences between entities of compared ontologies, the matching results of these basic matchers should be aggregated by an aggregation method. In this paper, a new weighted aggregation method for parallel composition of basic matchers based on genetic algorithm is presented. The evaluation has confirmed a high quality of the new aggregation method as this method has improved the process of matching two ontologies by obtaining higher confidence values of correctly found correspondences and thus increasing the quality of matching results. View Full-Text
Keywords: ontology matching; weighted aggregation; parallel composition; basic matchers; genetic algorithm ontology matching; weighted aggregation; parallel composition; basic matchers; genetic algorithm
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Gulić, M.; Vrdoljak, B.; Ptiček, M. Automatically Specifying a Parallel Composition of Matchers in Ontology Matching Process by Using Genetic Algorithm. Information 2018, 9, 138.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Information EISSN 2078-2489 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top