The MOUSE approach: Mapping Ontologies using UML for System Engineers
Journal Title: Computer Reviews Journal - Year 2018, Vol 1, Issue 1
Abstract
To address the problem of semantic heterogeneity, there has been a large body of research directed toward the study of semantic mapping technologies. Although various semantic mapping technologies have been investigated, facilitating the process for domain experts to perform a semantic data integration task is still not easy. This is because one is required not only to possess domain expertise but also to have a good understanding of knowledge engineering. This paper proposes an approach that automatically transforms an abstract semantic mapping syntax into a concrete executable mapping syntax, we call this approach MOUSE (Mapping Ontologies using UML for System Engineers). In order to evaluate MOUSE, an implementation of this approach for a semantic data integration use case has been developed (called SDI, Semantic Data Integration). The aim is to enable domain experts, particularly system engineers, to undertake mappings using a technology that they are familiar with (UML), while ensuring the created mappings are accurate and the approach is easy to use. The proposed UML-based abstract mapping syntax is evaluated through usability experiments conducted in a lab environment by participants who have skills equivalent to real life system engineers using the SDI tool. Results from the evaluations show that the participants could correctly undertake the semantic data integration task using the MOUSE approach while maintaining accuracy and usability (in terms of ease of use).
Authors and Affiliations
Seung-Hwa Chung, Dr. Wei Tai, Prof. Declan O'Sullivan, Dr. Aidan Boran Boran
Keywords
Related Articles
- EP ID EP433734
- DOI -
- Views 129
- Downloads 0
An Optimized Robust and Secure Digital Image Watermarking Technique Based on Modified Periodic Plus Smooth Decomposition
An optimized Robust and Secure Digital Image Watermarking technique based on modified Periodic Plus Smooth Decomposition (PPSD) is proposed. This proposed technique based on Periodic Plus Smooth Decomposition (PPSD), Dis...
Computation of Lebesgue’s Space-Filling Curve
The means of realizing or approximating the Lebesgue space-filling curve (SFC) with binary arithmetic on a uniformly spaced binary grid are not obvious, one problem being its formulation in terms of ternary representatio...
Testing Multiple Strategy Human Optimization based Artificial Human Optimization Algorithms
Recently a new trend titled ‘Artificial Human Optimization’ has become popular in Evolutionary Computing Domain. More than 30 papers were published in this new field proposed in December 2016. ‘Hassan Satish Particle Swa...
Cross-Layer Design of Dynamic Link Prediction Power Control Algorithm in Wireless Ad hoc Networks
In wireless communication era, Dynamic Link Prediction based Cross-Layer Power Control Algorithm (DLP-CLPCA) in wireless ad hoc networks provides a joint solution for the power consumption protocol as well as nodes link...
Why Estimation Algorithm of First Passage Time Transition Probabilities Concerns Genetic Algorithms Without Bit Mutation?
Concerning genetic algorithm without bit mutation such as absorbing Markov Chain, our aim is proposition modern algorithm to secure experiential and impractical results concerning first passage time transition probabilit...