基于图注意网络和文本信息的知识图补全

Shen Hong, Heng Qian, Yongchao Gao, Hongli Lyu
{"title":"基于图注意网络和文本信息的知识图补全","authors":"Shen Hong, Heng Qian, Yongchao Gao, Hongli Lyu","doi":"10.1109/CCET55412.2022.9906358","DOIUrl":null,"url":null,"abstract":"In knowledge graphs (KGs), there exist some unsolved problems such as incomplete data, hidden information with incomplete mining and so on. In the most completion models, the information of the triples in the KG is generally utilized, but the neighborhood information and rich entity description information are not included in the triples. In this paper, the knowledge graph completion (KGC) method is improved based on graph attention networks (GATs) with text information by using the neighborhood information of aggregated triples and entity description information. And the embedding capability of semantic information is enhanced in KGs. First, the feature vector of entity description information is extracted by the Bi-LSTM model and concatenated with the entity embedding in the triples. Then the joint vectors are trained by GATs to aggregate the neighborhood information. Next, the KGC task is realized by a decoder. Finally, the effectiveness of the proposed method is verified by the link prediction experiments in the public datasets FB15K-237 and WNISRR and comparison is investigated with several other existing methods. The test results show that most of the indicators in the two datasets are improved. Furthermore, it is proved that the model combined with multi-source information has better representation ability for entities, which can further improve the accuracy and comprehensive performance of KGC tasks.","PeriodicalId":329327,"journal":{"name":"2022 IEEE 5th International Conference on Computer and Communication Engineering Technology (CCET)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Knowledge Graph Completion Based on Graph Attention Networks and Text Information\",\"authors\":\"Shen Hong, Heng Qian, Yongchao Gao, Hongli Lyu\",\"doi\":\"10.1109/CCET55412.2022.9906358\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In knowledge graphs (KGs), there exist some unsolved problems such as incomplete data, hidden information with incomplete mining and so on. In the most completion models, the information of the triples in the KG is generally utilized, but the neighborhood information and rich entity description information are not included in the triples. In this paper, the knowledge graph completion (KGC) method is improved based on graph attention networks (GATs) with text information by using the neighborhood information of aggregated triples and entity description information. And the embedding capability of semantic information is enhanced in KGs. First, the feature vector of entity description information is extracted by the Bi-LSTM model and concatenated with the entity embedding in the triples. Then the joint vectors are trained by GATs to aggregate the neighborhood information. Next, the KGC task is realized by a decoder. Finally, the effectiveness of the proposed method is verified by the link prediction experiments in the public datasets FB15K-237 and WNISRR and comparison is investigated with several other existing methods. The test results show that most of the indicators in the two datasets are improved. Furthermore, it is proved that the model combined with multi-source information has better representation ability for entities, which can further improve the accuracy and comprehensive performance of KGC tasks.\",\"PeriodicalId\":329327,\"journal\":{\"name\":\"2022 IEEE 5th International Conference on Computer and Communication Engineering Technology (CCET)\",\"volume\":\"23 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.9906358\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.9906358","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在知识图中,存在着数据不完整、挖掘不完全的隐藏信息等尚未解决的问题。在大多数补全模型中,一般利用了KG中三元组的信息,但三元组中不包含邻域信息和丰富的实体描述信息。本文利用聚合三元组的邻域信息和实体描述信息,在具有文本信息的图注意网络(GATs)的基础上,改进了知识图补全方法。首先,利用Bi-LSTM模型提取实体描述信息的特征向量,并将其与实体嵌入的三元组进行级联;然后利用GATs对联合向量进行训练,对邻域信息进行聚合。然后,通过解码器实现KGC任务。最后,通过在公共数据集FB15K-237和WNISRR上的链路预测实验验证了该方法的有效性,并与其他几种现有方法进行了比较。测试结果表明,两个数据集的大部分指标都得到了改善。进一步证明了该模型结合多源信息对实体具有更好的表征能力,可以进一步提高KGC任务的准确性和综合性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Knowledge Graph Completion Based on Graph Attention Networks and Text Information
In knowledge graphs (KGs), there exist some unsolved problems such as incomplete data, hidden information with incomplete mining and so on. In the most completion models, the information of the triples in the KG is generally utilized, but the neighborhood information and rich entity description information are not included in the triples. In this paper, the knowledge graph completion (KGC) method is improved based on graph attention networks (GATs) with text information by using the neighborhood information of aggregated triples and entity description information. And the embedding capability of semantic information is enhanced in KGs. First, the feature vector of entity description information is extracted by the Bi-LSTM model and concatenated with the entity embedding in the triples. Then the joint vectors are trained by GATs to aggregate the neighborhood information. Next, the KGC task is realized by a decoder. Finally, the effectiveness of the proposed method is verified by the link prediction experiments in the public datasets FB15K-237 and WNISRR and comparison is investigated with several other existing methods. The test results show that most of the indicators in the two datasets are improved. Furthermore, it is proved that the model combined with multi-source information has better representation ability for entities, which can further improve the accuracy and comprehensive performance of KGC tasks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信