Bridge: A Unified Framework to Knowledge Graph Completion via Language Models and Knowledge Representation
Qiao Qiao, Yuepei Li, Qing Wang, Kang Zhou, Qi Li

TL;DR
Bridge is a novel framework that effectively combines structural knowledge graph information with semantic insights from pre-trained language models, improving triple completion accuracy.
Contribution
It introduces a joint encoding method for entities and relations using PLMs and employs a self-supervised learning approach to bridge the gap between KGs and PLMs.
Findings
Outperforms state-of-the-art models on benchmark datasets
Effectively combines structural and semantic information
Uses a novel view creation method to avoid semantic alteration
Abstract
Knowledge graph completion (KGC) is a task of inferring missing triples based on existing Knowledge Graphs (KGs). Both structural and semantic information are vital for successful KGC. However, existing methods only use either the structural knowledge from the KG embeddings or the semantic information from pre-trained language models (PLMs), leading to suboptimal model performance. Moreover, since PLMs are not trained on KGs, directly using PLMs to encode triples may be inappropriate. To overcome these limitations, we propose a novel framework called Bridge, which jointly encodes structural and semantic information of KGs. Specifically, we strategically encode entities and relations separately by PLMs to better utilize the semantic knowledge of PLMs and enable structured representation learning via a structural learning principle. Furthermore, to bridge the gap between KGs and PLMs, we…
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
TopicsSemantic Web and Ontologies · Advanced Graph Neural Networks · Topic Modeling
MethodsBootstrap Your Own Latent
