Similarity Computation of Heterogeneous Ontology Based on Graph Attention Network

Kun Yu
{"title":"Similarity Computation of Heterogeneous Ontology Based on Graph Attention Network","authors":"Kun Yu","doi":"10.1109/CCET55412.2022.9906374","DOIUrl":null,"url":null,"abstract":"Ontologies are crucial for data integration and information sharing. However, due to the different knowledge backgrounds of domain and ontology developers, the heterogeneity problem of multi-source ontology existence is more prominent, and ontology mapping is an important way to solve the ontology heterogeneity problem. However, the ontology similarity calculation methods among them still need to be improved in terms of accuracy or stability. In this paper, we propose an ontology similarity calculation method based on graph attention networks, which models ontologies as heterogeneous graph networks and uses the graph attention network model to introduce an attention mechanism to dynamically consider the influence of edge weights to achieve neighbor aggregation and perform similarity calculation. The experimental results show that this method has higher accuracy than the existing ontology similarity calculation methods.","PeriodicalId":329327,"journal":{"name":"2022 IEEE 5th International Conference on Computer and Communication Engineering Technology (CCET)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 5th International Conference on Computer and Communication Engineering Technology (CCET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCET55412.2022.9906374","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Ontologies are crucial for data integration and information sharing. However, due to the different knowledge backgrounds of domain and ontology developers, the heterogeneity problem of multi-source ontology existence is more prominent, and ontology mapping is an important way to solve the ontology heterogeneity problem. However, the ontology similarity calculation methods among them still need to be improved in terms of accuracy or stability. In this paper, we propose an ontology similarity calculation method based on graph attention networks, which models ontologies as heterogeneous graph networks and uses the graph attention network model to introduce an attention mechanism to dynamically consider the influence of edge weights to achieve neighbor aggregation and perform similarity calculation. The experimental results show that this method has higher accuracy than the existing ontology similarity calculation methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于图注意网络的异构本体相似度计算
本体对于数据集成和信息共享至关重要。然而,由于领域和本体开发者的知识背景不同,多源本体存在的异构问题更加突出,而本体映射是解决本体异构问题的重要途径。然而,其中的本体相似度计算方法在准确性和稳定性方面还有待提高。本文提出了一种基于图注意网络的本体相似度计算方法,该方法将本体建模为异构图网络,利用图注意网络模型引入注意机制,动态考虑边缘权值的影响,实现邻居聚合并进行相似度计算。实验结果表明,该方法比现有的本体相似度计算方法具有更高的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
5G Enabling Streaming Media Architecture with Edge Intelligence Gateway in Smart Grids VPN Traffic Identification Based on Tunneling Protocol Characteristics An Improved Clock Cycle Measurement Method for High-Speed Serial Signal with Duty-Cycle-Distortion Jitter Research on Banana Leaf Disease Detection Based on the Image Processing Technology Vision Transformer Based on Knowledge Distillation in TCM Image Classification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1