arXiv:2510. 09711v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have recently emerged as a powerful paradigm for Knowledge Graph Completion (KGC), offering strong reasoning and generalization capabilities beyond traditional embedding-based approaches.
By Wenbin Guo, Xin Wang, Jiaoyan Chen, Lingbing Guo, Zhao Li, Zirui Chen
arXiv:2606. 29860v1 Announce Type: new Abstract: Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications.
By Zihao Zheng, Borui Cai, Yao Zhao, Keshav Sood, Yong Xiang
arXiv:2604. 25693v2 Announce Type: replace Abstract: Most multi-modal knowledge graph completion (MMKGC) models use one embedding scorer to conduct both retrieval over the full entity set and final link prediction.
By Guanglin Niu, Bo Li
The paper introduces a new entity alignment foundation model that overcomes the limitations of existing models by addressing the "reasoning horizon gap". It employs a parallel encoding strategy that uses seed entity pairs as local anchors to guide message passing, thereby shortening inference paths and improving alignment across sparse, heterogeneous knowledge graphs. The model also incorporates a merged relation graph and a learnable interaction module, and experimental results demonstrate its strong generalizability to unseen knowledge graphs.
By Yuanning Cui, Zequn Sun, Wei Hu, Kexuan Xin, Zhangjie Fu
Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications. Due to their inherent incompleteness, knowledge graph completion (KGC) is widely studied and is typically formulated as triplet prediction, with link prediction as the dominant paradigm.
SNAP-KG is a framework for integrating newly arriving entities into knowledge graphs by assigning them to semantic communities using a projector that maps raw feature vectors into a learned embedding space. Unlike traditional multi-view graph clustering methods, SNAP-KG supports inductive inference for streaming entities without requiring graph access or model retraining. Experiments on five benchmark datasets and a large-scale KG show significant inference speedups and competitive clustering quality, while reducing candidate search for entity resolution and link prediction by up to 97%.
By Jui-Chien Lin, Mohammad Mohammadi Amiri, Oshani Seneviratne