arXiv:2506.00708cs.AIcs.CL2025-06EMNLP被引 5

用动态子图增强LLM,提升知识图谱补全效果

DrKGC: Dynamic Subgraph Retrieval-Augmented LLMs for Knowledge Graph Completion across General and Biomedical Domains

  • 基于学习的逻辑规则动态提取查询相关子图
  • 在通用与生物医学数据集上均超越现有方法
  • 适合需要可解释性的知识推理场景

知识图谱补全(KGC)旨在利用已有三元组和文本信息预测缺失三元组。近年来,生成式大语言模型(LLMs)被越来越多地用于图任务。然而,当前方法通常将图上下文编码为文本形式,未能充分挖掘LLMs对图结构的感知与推理能力。为此,我们提出DrKGC(动态子图检索增强的LLMs用于跨通用与生物医学领域的知识图谱补全)。DrKGC采用灵活轻量的模型训练策略,学习知识图谱中的结构嵌入与逻辑规则;随后,通过一种新型自底向上的图检索方法,依据所学规则为每个查询提取相关子图;最后,使用图卷积网络(GCN)适配器对检索到的子图进行处理,增强结构嵌入,并将其融入提示词以实现高效的LLM微调。在两个通用领域基准数据集和两个生物医学数据集上的实验结果表明,DrKGC表现优异。此外,生物医学领域的真实案例研究凸显了其可解释性与实际应用价值。

原文摘要 · Abstract (English)

Knowledge graph completion (KGC) aims to predict missing triples in knowledge graphs (KGs) by leveraging existing triples and textual information. Recently, generative large language models (LLMs) have been increasingly employed for graph tasks. However, current approaches typically encode graph context in textual form, which fails to fully exploit the potential of LLMs for perceiving and reasoning about graph structures. To address this limitation, we propose DrKGC (Dynamic Subgraph Retrieval-Augmented LLMs for Knowledge Graph Completion). DrKGC employs a flexible lightweight model training strategy to learn structural embeddings and logical rules within the KG. It then leverages a novel bottom-up graph retrieval method to extract a subgraph for each query guided by the learned rules. Finally, a graph convolutional network (GCN) adapter uses the retrieved subgraph to enhance the structural embeddings, which are then integrated into the prompt for effective LLM fine-tuning. Experimental results on two general domain benchmark datasets and two biomedical datasets demonstrate the superior performance of DrKGC. Furthermore, a realistic case study in the biomedical domain highlights its interpretability and practical utility.

知识图谱大模型子图检索生物医学

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。