Efficient Relational Context Perception for Knowledge Graph Completion
Wenkai Tu, Guojia Wan, Zhengchun Shang, Bo Du

TL;DR
This paper introduces TRP, a novel architecture for knowledge graph completion that models dynamic relational context efficiently, outperforming existing models in accuracy and computational cost.
Contribution
The paper proposes the Triple Receptance Perception (TRP) architecture combined with tensor decomposition for more expressive and efficient knowledge graph completion.
Findings
Outperforms state-of-the-art models on benchmark datasets
Achieves higher accuracy in link prediction and triple classification
Reduces computational complexity compared to transformer-based methods
Abstract
Knowledge Graphs (KGs) provide a structured representation of knowledge but often suffer from challenges of incompleteness. To address this, link prediction or knowledge graph completion (KGC) aims to infer missing new facts based on existing facts in KGs. Previous knowledge graph embedding models are limited in their ability to capture expressive features, especially when compared to deeper, multi-layer models. These approaches also assign a single static embedding to each entity and relation, disregarding the fact that entities and relations can exhibit different behaviors in varying graph contexts. Due to complex context over a fact triple of a KG, existing methods have to leverage complex non-linear context encoder, like transformer, to project entity and relation into low dimensional representations, resulting in high computation cost. To overcome these limitations, we propose…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Cognitive Computing and Networks · Bayesian Modeling and Causal Inference
