Relations Prediction for Knowledge Graph Completion using Large Language Models
Not on the map. Why?
Abstract (arXiv)
Knowledge Graphs have been widely used to represent facts in a structured format. Due to their large scale applications, knowledge graphs suffer from being incomplete. The relation prediction task obtains knowledge graph completion by assigning one or more possible relations to each pair of nodes. In this work, we make use of the knowledge graph node names to fine-tune a large language model for the relation prediction task. By utilizing the node names only we enable our model to operate sufficiently in the inductive settings. Our experiments show that we accomplish new scores on a widely used knowledge graph benchmark.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 30 references that are in the map. First posted on arXiv 4 May 2024.
Builds on
13 of 30 references.
References · 13
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 898
- 2021Recent Advances in Natural Language Processing via Large Pre-Trained Language Models: A Surveycited by 463
- 2019KG-BERT: BERT for Knowledge Graph Completioncited by 324
- 2019TuckER: Tensor Factorization for Knowledge Graph Completioncited by 290
- 2020Fast WordPiece Tokenizationcited by 87
- 2015Modeling Relation Paths for Representation Learning of Knowledge Basescited by 56
- 2020Efficient Probabilistic Logic Reasoning with Graph Neural Networkscited by 50
- 2020Type-augmented Relation Prediction in Knowledge Graphscited by 12
1 more
- 2021A shallow neural model for relation predictioncited by 6
Built on by
Citing papers per year: 2025: 1.
1 paper.