中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Time-Aware Representation Learning of Knowledge Graphs

文献类型:会议论文

作者Wang, Zikang1,3; Li, Linjing1,2,3; Zeng, Daniel1,2,3
出版日期2021-07
会议日期2021.07.18-22
会议地点在线
英文摘要

Representation learning is a fundamental task in knowledge graph-related research and applications. Most existing approaches learn representations for entities and relations only based on static facts, where temporal information has been ignored completely. This paper aims to learn time-aware repre- sentations for entities and relations in knowledge graphs. Based on how temporal information affects the learned embeddings, we propose three assumptions and build three different models, BTS, ETS, and RTS, respectively. In these models, we build two separate embedding spaces for entities and relations, the standard translation condition is checked after projecting embedding vectors between these spaces by model-specific transformations. As to the performance, the proposed RTS model achieves state- of-the-art results in three experiments conducted on two datasets: YAGO11k and Wikidata12k, which validates the effectiveness of our model. Comparing the results of all three models, we find that relation embeddings are time-sensitive and form natural ordering, while the effects of time on entity embeddings can be safely ignored for translation-based methods. Experiments also show that our findings can be used to simplify other existing models like HyTE.

源URL[http://ir.ia.ac.cn/handle/173211/44378]  
专题自动化研究所_复杂系统管理与控制国家重点实验室_互联网大数据与安全信息学研究中心
作者单位1.The State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Chinese Academy of Sciences
2.Shenzhen Artificial Intelligence and Data Science Institute (Longhua)
3.School of Artificial Intelligence, University of Chinese Academy of Sciences
推荐引用方式
GB/T 7714
Wang, Zikang,Li, Linjing,Zeng, Daniel. Time-Aware Representation Learning of Knowledge Graphs[C]. 见:. 在线. 2021.07.18-22.

入库方式: OAI收割

来源:自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。