Cumulative Path-Level Semantic Reasoning for Inductive Knowledge Graph Completion
By: Jiapu Wang , Xinghe Cheng , Zezheng Wu and more
Potential Business Impact:
Helps computers learn about new things faster.
Conventional Knowledge Graph Completion (KGC) methods aim to infer missing information in incomplete Knowledge Graphs (KGs) by leveraging existing information, which struggle to perform effectively in scenarios involving emerging entities. Inductive KGC methods can handle the emerging entities and relations in KGs, offering greater dynamic adaptability. While existing inductive KGC methods have achieved some success, they also face challenges, such as susceptibility to noisy structural information during reasoning and difficulty in capturing long-range dependencies in reasoning paths. To address these challenges, this paper proposes the Cumulative Path-Level Semantic Reasoning for inductive knowledge graph completion (CPSR) framework, which simultaneously captures both the structural and semantic information of KGs to enhance the inductive KGC task. Specifically, the proposed CPSR employs a query-dependent masking module to adaptively mask noisy structural information while retaining important information closely related to the targets. Additionally, CPSR introduces a global semantic scoring module that evaluates both the individual contributions and the collective impact of nodes along the reasoning path within KGs. The experimental results demonstrate that CPSR achieves state-of-the-art performance.
Similar Papers
ProgRAG: Hallucination-Resistant Progressive Retrieval and Reasoning over Knowledge Graphs
Artificial Intelligence
Helps computers answer hard questions using smart steps.
Higher-Order Knowledge Representations for Agentic Scientific Reasoning
Artificial Intelligence
Finds new science ideas by connecting many facts.
StruProKGR: A Structural and Probabilistic Framework for Sparse Knowledge Graph Reasoning
Computation and Language
Finds hidden facts in incomplete knowledge maps.