RTFE: A Recursive Temporal Fact Embedding Framework for Temporal Knowledge Graph Completion
원문 초록
Static knowledge graph (SKG) embedding (SKGE) has been studied intensively in the past years. Recently, temporal knowledge graph (TKG) embedding (TKGE) has emerged. In this paper, we propose a Recursive Temporal Fact Embedding (RTFE) framework to transplant SKGE models to TKGs and to enhance the performance of existing TKGE models for TKG completion. Different from previous work which ignores the continuity of states of TKG in time evolution, we treat the sequence of graphs as a Markov chain, which transitions from the previous state to the next state. RTFE takes the SKGE to initialize the embeddings of TKG. Then it recursively tracks the state transition of TKG by passing updated parameters/features between timestamps. Specifically, at each timestamp, we approximate the state transition as the gradient update process. Since RTFE learns each timestamp recursively, it can naturally transit to future timestamps. Experiments on five TKG datasets show the effectiveness of RTFE.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Knowledge Graph Embedding via Graph Attenuated Attention Networks
Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs
GenIC: An LLM-Based Framework for Instance Completion in Knowledge Graphs
ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion
Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction
Knowledge Graph Completion with Mixed Geometry Tensor Factorization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.