返回
Hamming Distance Encoding Multihop Relation Knowledge Graph Completion
DOI:10.1109/ACCESS.2020.3004448.png)
摘要
En 中文
Knowledge graphs (KGs) play an important role in many real-world applications like information retrieval, question answering, relation extraction, etc. To reveal implicit knowledge from a knowledge graph (KG), viz. knowledge graph completion (KGC), is a crucial task for the downstream applications based on KG. For this purpose various embedding-based approaches have been proposed recently. This paper proposes a new approach named HRESCAL to KGC. It extends the well-known embedding-based approach RESCAL by introducing Hamming distance-based encoder to capture implicit multihop and partial inverse relation features in a KG. Experimental results on widely used KGC benchmarks show that the new approach achieves state-of-the-art or is competitive AUC performance.
Keyword:
Knowledge graph
knowledge graph completion
tensor factorization
matrix factorization
Hamming distance
multihop relations
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Entity Linking: An Issue to Extract Corresponding Entity With Knowledge Base实体链接: 提取具有知识库的对应实体的问题
IEEE ACCESS
IF3.6
Heavy metal tolerance of marine phytoplankton. IV. Combined effect of zinc and cadmium on growth and uptake in some marine diatoms海洋浮游植物对重金属的耐受性。四。锌和镉对某些海洋硅藻生长和吸收的综合影响
Radiation-induced graft copolymerization of dimethylaminoethyl methacrylate onto graphene oxide for Cr(VI) removal辐射诱导甲基丙烯酸二甲基氨基乙酯在氧化石墨烯上的接枝共聚以去除Cr(VI)

