StruProKGR: A Structural and Probabilistic Framework for Sparse Knowledge Graph Reasoning

• URL: http://arxiv.org/abs/2512.12613v1
• Date: Sun, 14 Dec 2025 09:36:58 GMT
• Title: StruProKGR: A Structural and Probabilistic Framework for Sparse Knowledge Graph Reasoning
• Authors: Yucan Guo, Saiping Guan, Miao Su, Zeya Zhao, Xiaolong Jin, Jiafeng Guo, Xueqi Cheng,
• Abstract summary: Sparse Knowledge Graphs (KGs) are commonly encountered in real-world applications, where knowledge is often incomplete or limited.<n>We propose a Structural and Probabilistic framework named StruProKGR, tailored for efficient and interpretable reasoning on sparse KGs.
• Score: 68.58655814341996
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Sparse Knowledge Graphs (KGs) are commonly encountered in real-world applications, where knowledge is often incomplete or limited. Sparse KG reasoning, the task of inferring missing knowledge over sparse KGs, is inherently challenging due to the scarcity of knowledge and the difficulty of capturing relational patterns in sparse scenarios. Among all sparse KG reasoning methods, path-based ones have attracted plenty of attention due to their interpretability. Existing path-based methods typically rely on computationally intensive random walks to collect paths, producing paths of variable quality. Additionally, these methods fail to leverage the structured nature of graphs by treating paths independently. To address these shortcomings, we propose a Structural and Probabilistic framework named StruProKGR, tailored for efficient and interpretable reasoning on sparse KGs. StruProKGR utilizes a distance-guided path collection mechanism to significantly reduce computational costs while exploring more relevant paths. It further enhances the reasoning process by incorporating structural information through probabilistic path aggregation, which prioritizes paths that reinforce each other. Extensive experiments on five sparse KG reasoning benchmarks reveal that StruProKGR surpasses existing path-based methods in both effectiveness and efficiency, providing an effective, efficient, and interpretable solution for sparse KG reasoning.

Related papers

• HELP: HyperNode Expansion and Logical Path-Guided Evidence Localization for Accurate and Efficient GraphRAG [53.30561659838455]
  Large Language Models (LLMs) often struggle with inherent knowledge boundaries and hallucinations.<n>Retrieval-Augmented Generation (RAG) frequently overlooks structural interdependencies essential for multi-hop reasoning.<n>Help achieves competitive performance across multiple simple and multi-hop QA benchmarks and up to a 28.8$times$ speedup over leading Graph-based RAG baselines.
  arXiv  Detail & Related papers  (2026-02-24T14:05:29Z)
• Cumulative Path-Level Semantic Reasoning for Inductive Knowledge Graph Completion [9.623163073915741]
  This paper proposes the Cumulative Path-Level Semantic Reasoning for inductive knowledge graph completion (CPSR) framework.<n>CPSR simultaneously captures both the structural and semantic information of KGs to enhance the inductive KGC task.
  arXiv  Detail & Related papers  (2026-01-09T08:34:05Z)
• Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning [9.894106590443714]
  We propose textbfMoKGR, a mixture-of-experts framework that personalizes path exploration.<n>MoKGR demonstrates superior performance in both transductive and inductive settings.
  arXiv  Detail & Related papers  (2025-07-28T03:30:28Z)
• Learning Efficient and Generalizable Graph Retriever for Knowledge-Graph Question Answering [75.12322966980003]
  Large Language Models (LLMs) have shown strong inductive reasoning ability across various domains.<n>Most existing RAG pipelines rely on unstructured text, limiting interpretability and structured reasoning.<n>Recent studies have explored integrating knowledge graphs with LLMs for knowledge graph question answering.<n>We propose RAPL, a novel framework for efficient and effective graph retrieval in KGQA.
  arXiv  Detail & Related papers  (2025-06-11T12:03:52Z)
• Soft Reasoning Paths for Knowledge Graph Completion [41.04734533217766]
  Reasoning paths are reliable information in knowledge graph completion (KGC)<n>In real-world applications, it is difficult to guarantee that computationally affordable paths exist toward all candidate entities.<n>We introduce soft reasoning paths to make the proposed algorithm more stable against missing path circumstances.
  arXiv  Detail & Related papers  (2025-05-06T08:12:48Z)
• K-Paths: Reasoning over Graph Paths for Drug Repurposing and Drug Interaction Prediction [21.72997408572975]
  K-Paths is a model-agnostic retrieval framework that extracts structured, diverse, and biologically meaningful multi-hop paths from dense biomedical knowledge graphs.<n>These paths enable the prediction of unobserved drug-drug and drug-disease interactions.<n>Experiments show that K-Paths improves zero-shot reasoning across state-of-the-art language models.
  arXiv  Detail & Related papers  (2025-02-18T23:55:24Z)
• Anchoring Path for Inductive Relation Prediction in Knowledge Graphs [69.81600732388182]
  APST takes both APs and CPs as the inputs of a unified Sentence Transformer architecture. We evaluate APST on three public datasets and achieve state-of-the-art (SOTA) performance in 30 of 36 transductive, inductive, and few-shot experimental settings.
  arXiv  Detail & Related papers  (2023-12-21T06:02:25Z)
• Exploring & Exploiting High-Order Graph Structure for Sparse Knowledge Graph Completion [20.45256490854869]
  We present a novel framework, LR-GCN, that is able to automatically capture valuable long-range dependency among entities. The proposed approach comprises two main components: a GNN-based predictor and a reasoning path distiller.
  arXiv  Detail & Related papers  (2023-06-29T15:35:34Z)
• River of No Return: Graph Percolation Embeddings for Efficient Knowledge Graph Reasoning [16.143817898963785]
  We study Graph Neural Networks (GNNs)-based embedding techniques for knowledge graph (KG) reasoning. For the first time, we link the path redundancy issue in the state-of-the-art KG reasoning models based on path encoding and message passing to the transformation error in model training. We propose an efficient Graph Percolation Process motivated by the percolation model in Fluid Mechanics, and design a lightweight GNN-based KG reasoning framework called Graph Percolation Embeddings (GraPE)
  arXiv  Detail & Related papers  (2023-05-17T06:13:28Z)
• Normalizing Flow-based Neural Process for Few-Shot Knowledge Graph Completion [69.55700751102376]
  Few-shot knowledge graph completion (FKGC) aims to predict missing facts for unseen relations with few-shot associated facts. Existing FKGC methods are based on metric learning or meta-learning, which often suffer from the out-of-distribution and overfitting problems. In this paper, we propose a normalizing flow-based neural process for few-shot knowledge graph completion (NP-FKGC)
  arXiv  Detail & Related papers  (2023-04-17T11:42:28Z)
• Joint Semantics and Data-Driven Path Representation for Knowledge Graph Inference [60.048447849653876]
  We propose a novel joint semantics and data-driven path representation that balances explainability and generalization in the framework of KG embedding. Our proposed model is evaluated on two classes of tasks: link prediction and path query answering task.
  arXiv  Detail & Related papers  (2020-10-06T10:24:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.