A Survey of Link Prediction in N-ary Knowledge Graphs

Jiyao Wei, Saiping Guan, Da Li, Xiaolong Jin, Jiafeng Guo +1 more
6/10/2025
cs.AI

No official code found. Best implementation: JiyaoWei/LP_NKGs (8 stars, last commit 2025-06-25).

Abstract

N-ary Knowledge Graphs (NKGs) are a specialized type of knowledge graph designed to efficiently represent complex real-world facts. Unlike traditional knowledge graphs, where a fact typically involves two entities, NKGs can capture n-ary facts containing more than two entities. Link prediction in NKGs aims to predict missing elements within these n-ary facts, which is essential for completing NKGs and improving the performance of downstream applications. This task has recently gained significant attention. In this paper, we present the first comprehensive survey of link prediction in NKGs, providing an overview of the field, systematically categorizing existing methods, and analyzing their performance and application scenarios. We also outline promising directions for future research.

View on arXivView PDF

Code Implementations(1)

JiyaoWei/LP_NKGsCommunity100%
80May 19, 20251 years ago

Similar Papers

Cite this paper

@article{wei2025survey,
  title  = {A Survey of Link Prediction in N-ary Knowledge Graphs},
  author = {Jiyao Wei and Saiping Guan and Da Li and Xiaolong Jin and Jiafeng Guo and Xueqi Cheng},
  year   = {2025},
  eprint = {2506.08970},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.08970v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.08970.svg)](https://codeofpaper.com/paper/2506.08970)

Discussion