Knowledge Graph Embedding for Hyper-Relational Data
Knowledge Graph Embedding for Hyper-Relational Data作者机构:the State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and TelecommunicationsBeijing 100876China the Key Laboratory of University Witeless CommunicationMinistry of EducationBeijing University of Posts and TelecommunicationsBeijing 100876China
出 版 物:《Tsinghua Science and Technology》 (清华大学学报(自然科学版(英文版))
年 卷 期:2017年第22卷第2期
页 面:185-197页
核心收录:
学科分类:12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 081104[工学-模式识别与智能系统] 08[工学] 0835[工学-软件工程] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:partially supported by the National Natural Science Foundation of China(Nos.61302077 61520106007 61421061 and 61602048)
主 题:distributed representation transfer matrix knowledge graph embedding
摘 要:Knowledge graph representation has been a long standing goal of artificial intelligence. In this paper,we consider a method for knowledge graph embedding of hyper-relational data, which are commonly found in knowledge graphs. Previous models such as Trans(E, H, R) and CTrans R are either insufficient for embedding hyper-relational data or focus on projecting an entity into multiple embeddings, which might not be effective for generalization nor accurately reflect real knowledge. To overcome these issues, we propose the novel model Trans HR, which transforms the hyper-relations in a pair of entities into an individual vector, serving as a translation between them. We experimentally evaluate our model on two typical tasks—link prediction and triple *** results demonstrate that Trans HR significantly outperforms Trans(E, H, R) and CTrans R, especially for hyperrelational data.