Meta-Learning Based Knowledge Extrapolation for Temporal Knowledge Graph
Zhongwu Chen,Chengjin Xu,Fenglong Su,Zhen Huang,Yong Dou +4 more
- 11 Feb 2023
TL;DR: In this article , a meta-learning based temporal knowledge graph extrapolation (MTKGE) model is proposed, which is trained on link prediction tasks sampled from the existing temporal KGs and tested in the emerging TKGs with unseen entities and relations.
read more
Abstract: In the last few years, the solution to Knowledge Graph (KG) completion via learning embeddings of entities and relations has attracted a surge of interest. Temporal KGs(TKGs) extend traditional Knowledge Graphs (KGs) by associating static triples with timestamps forming quadruples. Different from KGs and TKGs in the transductive setting, constantly emerging entities and relations in incomplete TKGs create demand to predict missing facts with unseen components, which is the extrapolation setting. Traditional temporal knowledge graph embedding (TKGE) methods are limited in the extrapolation setting since they are trained within a fixed set of components. In this paper, we propose a Meta-Learning based Temporal Knowledge Graph Extrapolation (MTKGE) model, which is trained on link prediction tasks sampled from the existing TKGs and tested in the emerging TKGs with unseen entities and relations. Specifically, we meta-train a GNN framework that captures relative position patterns and temporal sequence patterns between relations. The learned embeddings of patterns can be transferred to embed unseen components. Experimental results on two different TKG extrapolation datasets show that MTKGE consistently outperforms both the existing state-of-the-art models for knowledge graph extrapolation and specifically adapted KGE and TKGE baselines.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Incorporating Structured Sentences with Time-enhanced BERT for Fully-inductive Temporal Relation Prediction
TL;DR: In this paper , the authors extend the fully-inductive setting, where entities in the training and test sets are totally disjoint, into TKGs and take a further step towards a more flexible and time-sensitive temporal relation prediction approach, incorporating Structured Sentences with Time-enhanced BERT.
8
Temporal Extrapolation and Knowledge Transfer for Lifelong Temporal Knowledge Graph Reasoning
Zhongwu Chen,Chengjin Xu,Fenglong Su,Zhen Huang,Yong Dou +4 more
TL;DR: This work forms lifelong TKG reasoning as a temporal-path-based reinforcement learning (RL) framework, which adds temporal displacement into the action space of RL to extrapolate for the future and further proposes a temporal-rule-based reward shaping to guide the training.
1
Zero-Shot Relational Learning on Temporal Knowledge Graphs with Large Language Models
Zifeng Ding,Heling Cai,Jingpei Wu,Yunpu Ma,Ruotong Liao,Bo Xiong,Volker Tresp +6 more
TL;DR: This work first input the text descriptions of KG relations into large language models (LLMs) for generating relation representations, and then introduces them into embedding-based TKGF methods, enabling TK GF models to recognize zero-shot relations even without any observed graph context.
Continuous-Time Transformer with Large Language Model for Temporal Knowledge Graph Forecasting
Dong Zhang,Guan-yu Li,Bo Ning,Yiwei Gao,Yueqi Zhang,Dongjin Yang +5 more
CAPER: Enhancing Career Trajectory Prediction using Temporal Knowledge Graph and Ternary Relationship
Yeon-Chang Lee,JaeHyun Lee,Michiharu Yamashita,Dongwon Lee,Sang-Wook Kim +4 more
- 28 Aug 2024
TL;DR: This study proposes CAPER, a novel temporal knowledge graph model that jointly considers user, position, and company dependencies to accurately predict career trajectories, outperforming state-of-the-art methods by 6.80% and 34.58% in company and position predictions, respectively.
References
•Proceedings Article
Translating Embeddings for Modeling Multi-relational Data
Antoine Bordes,Nicolas Usunier,Alberto Garcia-Duran,Jason Weston,Oksana Yakhnenko +4 more
- 05 Dec 2013
TL;DR: TransE is proposed, a method which models relationships by interpreting them as translations operating on the low-dimensional embeddings of the entities, which proves to be powerful since extensive experiments show that TransE significantly outperforms state-of-the-art methods in link prediction on two knowledge bases.
Modeling Relational Data with Graph Convolutional Networks
Michael Sejr Schlichtkrull,Thomas Kipf,Peter Bloem,Rianne van den Berg,Ivan Titov,Ivan Titov,Max Welling,Max Welling +7 more
- 03 Jun 2018
TL;DR: It is shown that factorization models for link prediction such as DistMult can be significantly improved through the use of an R-GCN encoder model to accumulate evidence over multiple inference steps in the graph, demonstrating a large improvement of 29.8% on FB15k-237 over a decoder-only baseline.
•Proceedings Article
Knowledge graph embedding by translating on hyperplanes
Zhen Wang,Jianwen Zhang,Jianlin Feng,Zheng Chen +3 more
- 27 Jul 2014
TL;DR: This paper proposes TransH which models a relation as a hyperplane together with a translation operation on it and can well preserve the above mapping properties of relations with almost the same model complexity of TransE.
•Proceedings Article
Learning entity and relation embeddings for knowledge graph completion
Yankai Lin,Zhiyuan Liu,Maosong Sun,Yang Liu,Xuan Zhu +4 more
- 25 Jan 2015
TL;DR: TransR is proposed to build entity and relation embeddings in separate entity space and relation spaces to build translations between projected entities and to evaluate the models on three tasks including link prediction, triple classification and relational fact extraction.
•Proceedings Article
Embedding Entities and Relations for Learning and Inference in Knowledge Bases
Bishan Yang,Wen-tau Yih,Xiaodong He,Jianfeng Gao,Li Deng +4 more
- 01 May 2015
TL;DR: It is found that embeddings learned from the bilinear objective are particularly good at capturing relational semantics and that the composition of relations is characterized by matrix multiplication.