应用本体的分层合并方法:以农业领域为例

S. Amarasinghe, W. A. Indika, Jeevani Goonetilake
{"title":"应用本体的分层合并方法:以农业领域为例","authors":"S. Amarasinghe, W. A. Indika, Jeevani Goonetilake","doi":"10.4038/JUR.V8I1.7961","DOIUrl":null,"url":null,"abstract":"Ontology is a machine interpretable way of representing knowledge in a precise and complete way favorable to solve many problems in the field of knowledge engineering. Different knowledge areas evolve with the time and the applications which use ontologies should be updated with new knowledge accordingly. It is more effective to combine the ontologies with new knowledge with the existing application ontologies rather than designing a new ontology from scratch. When combining ontologies, keeping the original usability of the initial ontologies and the heterogeneity of the components of the ontologies are the main obstacles. As there are no universal standard for naming of ontology components, this is a major reason for the heterogeneity problem. Methods for overcoming these problems are needed. In this research, we have proposed two algorithms to overcome the aforementioned problems. These algorithms for finding correspondences of ontology concepts and merging domain specific application ontologies keeping the original usability of the initial ontologies are the main outcomes of this research. The proposed algorithms are evaluated in terms of accuracy by comparing the resultant ontology merged using the proposed algorithm and the resultant ontology merged by an expert. The evaluation results prove that the proposed methodology merges the domain specific application ontologies very similar to the ontology merged by human intervention.","PeriodicalId":158329,"journal":{"name":"Journal of the University of Ruhuna","volume":"74 9","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Layered Approach for Merging Application Ontologies: A Case Study from Agriculture Domain\",\"authors\":\"S. Amarasinghe, W. A. Indika, Jeevani Goonetilake\",\"doi\":\"10.4038/JUR.V8I1.7961\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ontology is a machine interpretable way of representing knowledge in a precise and complete way favorable to solve many problems in the field of knowledge engineering. Different knowledge areas evolve with the time and the applications which use ontologies should be updated with new knowledge accordingly. It is more effective to combine the ontologies with new knowledge with the existing application ontologies rather than designing a new ontology from scratch. When combining ontologies, keeping the original usability of the initial ontologies and the heterogeneity of the components of the ontologies are the main obstacles. As there are no universal standard for naming of ontology components, this is a major reason for the heterogeneity problem. Methods for overcoming these problems are needed. In this research, we have proposed two algorithms to overcome the aforementioned problems. These algorithms for finding correspondences of ontology concepts and merging domain specific application ontologies keeping the original usability of the initial ontologies are the main outcomes of this research. The proposed algorithms are evaluated in terms of accuracy by comparing the resultant ontology merged using the proposed algorithm and the resultant ontology merged by an expert. The evaluation results prove that the proposed methodology merges the domain specific application ontologies very similar to the ontology merged by human intervention.\",\"PeriodicalId\":158329,\"journal\":{\"name\":\"Journal of the University of Ruhuna\",\"volume\":\"74 9\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the University of Ruhuna\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4038/JUR.V8I1.7961\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the University of Ruhuna","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4038/JUR.V8I1.7961","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本体是一种机器可解释的、精确完整的知识表示方式,有利于解决知识工程领域的许多问题。不同的知识领域随着时间的推移而发展,使用本体的应用程序也应该相应更新新的知识。将具有新知识的本体与现有的应用本体结合起来比从头开始设计新的本体更有效。在组合本体时,保持初始本体的原始可用性和本体组件的异构性是主要障碍。由于本体组件的命名没有统一的标准,这是异构问题的主要原因。需要克服这些问题的方法。在本研究中,我们提出了两种算法来克服上述问题。这些寻找本体概念对应关系和合并特定领域应用本体的算法是本研究的主要成果,同时保持了初始本体的原始可用性。通过比较使用所提算法合并的结果本体和专家合并的结果本体,对所提算法的准确性进行了评估。评价结果表明,该方法合并的领域特定应用本体与人工干预合并的本体非常相似。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Layered Approach for Merging Application Ontologies: A Case Study from Agriculture Domain
Ontology is a machine interpretable way of representing knowledge in a precise and complete way favorable to solve many problems in the field of knowledge engineering. Different knowledge areas evolve with the time and the applications which use ontologies should be updated with new knowledge accordingly. It is more effective to combine the ontologies with new knowledge with the existing application ontologies rather than designing a new ontology from scratch. When combining ontologies, keeping the original usability of the initial ontologies and the heterogeneity of the components of the ontologies are the main obstacles. As there are no universal standard for naming of ontology components, this is a major reason for the heterogeneity problem. Methods for overcoming these problems are needed. In this research, we have proposed two algorithms to overcome the aforementioned problems. These algorithms for finding correspondences of ontology concepts and merging domain specific application ontologies keeping the original usability of the initial ontologies are the main outcomes of this research. The proposed algorithms are evaluated in terms of accuracy by comparing the resultant ontology merged using the proposed algorithm and the resultant ontology merged by an expert. The evaluation results prove that the proposed methodology merges the domain specific application ontologies very similar to the ontology merged by human intervention.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信