通过结构追踪提升知识图谱推理的准确性和完整性
STEM: Structure-Tracing Evidence Mining for Knowledge Graphs-Driven Retrieval-Augmented Generation

- 将多跳推理转为受模式引导的图搜索,利用结构先验构建查询图
- 引入三元组依赖GNN生成全局引导子图,提升检索效果
- 在多个基准上达到当前最优,适合复杂推理任务研究者
基于知识图谱的问答(KGQA)在复杂推理任务中至关重要,但长期面临两个挑战:知识图谱的结构异质性常导致检索时语义错配,现有推理路径检索方法缺乏全局结构视角。为此,我们提出结构追踪证据挖掘(STEM),将多跳推理重构为受模式引导的图搜索任务。首先,设计语义到结构的投影流程,利用知识图谱的结构先验将查询分解为原子关系断言,并构建自适应查询模式图。随后,执行全局感知的节点锚定与子图检索,从知识图谱中获取最终的证据推理图。为更有效地整合全局结构信息,设计三元组依赖GNN(Triple-GNN),生成全局引导子图(Guidance Graph)以指导图构建。STEM显著提升了多跳推理图检索的准确率和证据完整性,在多个多跳推理基准上达到当前最优性能。
原文摘要 · Abstract (English)
Knowledge Graph-based Question Answering (KGQA) plays a pivotal role in complex reasoning tasks but remains constrained by two persistent challenges: the structural heterogeneity of Knowledge Graphs(KGs) often leads to semantic mismatch during retrieval, while existing reasoning path retrieval methods lack a global structural perspective. To address these issues, we propose Structure-Tracing Evidence Mining (STEM), a novel framework that reframes multi-hop reasoning as a schema-guided graph search task. First, we design a Semantic-to-Structural Projection pipeline that leverages KG structural priors to decompose queries into atomic relational assertions and construct an adaptive query schema graph. Subsequently, we execute globally-aware node anchoring and subgraph retrieval to obtain the final evidence reasoning graph from KG. To more effectively integrate global structural information during the graph construction process, we design a Triple-Dependent GNN (Triple-GNN) to generate a Global Guidance Subgraph (Guidance Graph) that guides the construction. STEM significantly improves both the accuracy and evidence completeness of multi-hop reasoning graph retrieval, and achieves State-of-the-Art performance on multiple multi-hop benchmarks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。