Incorporating Entity Type Information into Knowledge Representation Learning

Wenyu Huang, Guohua Wang, Huakui Zhang, Feng Chen
{"title":"Incorporating Entity Type Information into Knowledge Representation Learning","authors":"Wenyu Huang, Guohua Wang, Huakui Zhang, Feng Chen","doi":"10.1109/DSC50466.2020.00023","DOIUrl":null,"url":null,"abstract":"Knowledge Representation Learning (KRL), which is also known as Knowledge Embedding, is a very useful method to represent complex relations in knowledge graphs. The low-dimensional representation learned by KRL models makes a contribution to many tasks like recommender system and question answering. Recently, many KRL models are trained using square loss or cross entropy loss based on Closed World Assumption (CWA). Although CWA is an easy way for training, it violates the link prediction task which exploits KRL. To overcome the drawback, in this paper, we introduce a new method, Type-based Prior Possibility Assumption (TPPA). TPPA calculates type based prior possibilities for missing triplets instead of zeros in the training process of KRL to weaken the bad influence of CWA. We compare TPPA with the baseline method CWA in ConvE and TuckER, two common frameworks for knowledge representation learning. The experiment results on FB15k-237 dataset show that TPPA based training method outperforms CWA based training method in link prediction task.","PeriodicalId":423182,"journal":{"name":"2020 IEEE Fifth International Conference on Data Science in Cyberspace (DSC)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Fifth International Conference on Data Science in Cyberspace (DSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSC50466.2020.00023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Knowledge Representation Learning (KRL), which is also known as Knowledge Embedding, is a very useful method to represent complex relations in knowledge graphs. The low-dimensional representation learned by KRL models makes a contribution to many tasks like recommender system and question answering. Recently, many KRL models are trained using square loss or cross entropy loss based on Closed World Assumption (CWA). Although CWA is an easy way for training, it violates the link prediction task which exploits KRL. To overcome the drawback, in this paper, we introduce a new method, Type-based Prior Possibility Assumption (TPPA). TPPA calculates type based prior possibilities for missing triplets instead of zeros in the training process of KRL to weaken the bad influence of CWA. We compare TPPA with the baseline method CWA in ConvE and TuckER, two common frameworks for knowledge representation learning. The experiment results on FB15k-237 dataset show that TPPA based training method outperforms CWA based training method in link prediction task.
将实体类型信息纳入知识表示学习
知识表示学习(Knowledge Representation Learning, KRL),又称知识嵌入(Knowledge Embedding),是表示知识图中复杂关系的一种非常有用的方法。KRL模型学习到的低维表示为推荐系统和问答等许多任务做出了贡献。目前,许多KRL模型都是基于封闭世界假设(CWA),使用平方损失或交叉熵损失进行训练。虽然CWA是一种简单的训练方法,但它违背了利用KRL的链路预测任务。为了克服这一缺陷,本文引入了一种新的方法——基于类型的先验可能性假设(TPPA)。TPPA在KRL的训练过程中计算缺失三元组的基于类型的先验可能性,而不是零,以减弱CWA的不良影响。我们将TPPA与ConvE和TuckER(两种常见的知识表示学习框架)中的基线方法CWA进行了比较。在FB15k-237数据集上的实验结果表明,基于TPPA的训练方法在链路预测任务中优于基于CWA的训练方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信