Enhancing CNN Based Knowledge Graph Embedding Algorithms Using Auxiliary Vectors: A Case Study of Wordnet Knowledge Graph

Chanathip Pornprasit, Pattararat Kiattipadungkul, Peeranut Duangkaew, Suppawong Tuarob, Thanapon Noraset
{"title":"Enhancing CNN Based Knowledge Graph Embedding Algorithms Using Auxiliary Vectors: A Case Study of Wordnet Knowledge Graph","authors":"Chanathip Pornprasit, Pattararat Kiattipadungkul, Peeranut Duangkaew, Suppawong Tuarob, Thanapon Noraset","doi":"10.1109/ecti-con49241.2020.9158288","DOIUrl":null,"url":null,"abstract":"Knowledge graphs (KGs) have been utilized by various business fields. One example is Google that stores data in knowledge graphs for searching and retrieval tasks. Even though these graphs have reached an impressive size, they are far from completeness. Missing relations in knowledge graphs is a severe problem for algorithms that operate over knowledge graphs. There are many researchers trying to develop knowledge graph embedding methods so that they can handle different types of relations. ConvKB is one of the knowledge graph embedding methods that utilize convolution neural networks (CNN). However, this method lacks the ability to handle symmetric relations. Being inspired by this limitation, we would like to enhance this method by proposing ConvKB+, which is obtained by modifying ConvKB’s CNN structure and introducing an additional relation vector. Our experiment results show that our method outperforms ConvKB by achieving higher MRR on some symmetric relations of the WN18RR dataset.","PeriodicalId":371552,"journal":{"name":"2020 17th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)","volume":"48 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 17th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ecti-con49241.2020.9158288","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Knowledge graphs (KGs) have been utilized by various business fields. One example is Google that stores data in knowledge graphs for searching and retrieval tasks. Even though these graphs have reached an impressive size, they are far from completeness. Missing relations in knowledge graphs is a severe problem for algorithms that operate over knowledge graphs. There are many researchers trying to develop knowledge graph embedding methods so that they can handle different types of relations. ConvKB is one of the knowledge graph embedding methods that utilize convolution neural networks (CNN). However, this method lacks the ability to handle symmetric relations. Being inspired by this limitation, we would like to enhance this method by proposing ConvKB+, which is obtained by modifying ConvKB’s CNN structure and introducing an additional relation vector. Our experiment results show that our method outperforms ConvKB by achieving higher MRR on some symmetric relations of the WN18RR dataset.
利用辅助向量增强基于CNN的知识图嵌入算法——以Wordnet知识图为例
知识图谱(Knowledge graphs, KGs)已广泛应用于各个商业领域。谷歌就是一个例子,它将数据存储在知识图中,用于搜索和检索任务。尽管这些图已经达到了令人印象深刻的大小,但它们还远远不够完整。知识图中关系缺失是知识图算法面临的一个严重问题。许多研究者试图开发知识图嵌入方法,以处理不同类型的关系。ConvKB是一种利用卷积神经网络(CNN)的知识图嵌入方法。但是,这种方法缺乏处理对称关系的能力。受到这一限制的启发,我们想通过提出ConvKB+来增强该方法,该方法是通过修改ConvKB的CNN结构并引入额外的关系向量来获得的。实验结果表明,我们的方法在WN18RR数据集的一些对称关系上获得了更高的MRR,优于ConvKB。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信