Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion
원문 초록
Temporal knowledge graph completion aims to infer the missing facts in temporal knowledge graphs. Current approaches usually embed factual knowledge into continuous vector space and apply geometric operations to learn potential patterns in temporal knowledge graphs. However, these methods only adopt a single operation, which may have limitations in capturing the complex temporal dynamics present in temporal knowledge graphs. Therefore, we propose a simple but effective method, i.e. TCompoundE, which is specially designed with two geometric operations, including time-specific and relation-specific operations. We provide mathematical proofs to demonstrate the ability of TCompoundE to encode various relation patterns. Experimental results show that our proposed model significantly outperforms existing temporal knowledge graph embedding models. Our code is available at https://github.com/nk-ruiying/TCompoundE.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Knowledge Graph Embedding via Graph Attenuated Attention Networks
Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction
Multi-dataset and Transfer Learning Using Gene Expression Knowledge Graphs
SMART: Relation-Aware Learning of Geometric Representations for Knowledge Graphs
Injecting Knowledge Graphs into Large Language Models
QuatE-D: A Distance-Based Quaternion Model for Knowledge Graph Embedding
토론
이 논문과 연결된 포럼 글이 아직 없습니다.