用图结构信息增强大模型上下文学习,提升知识图谱补全效果。
In-Context Learning with Topological Information for Knowledge Graph Completion
- 将图拓扑与本体知识注入大模型上下文,引导推理
- 在跨域场景下比基线模型提升显著,尤其在小规模数据集上
- 适合需要少样本推理的开放知识图谱任务
知识图谱在信息检索、问答系统和决策支持等应用中至关重要,但其不完整性常限制实际效用。尽管知识图谱补全(KGC)已有广泛研究,近年来大语言模型(LLM)的兴起为创新带来新可能。上下文学习作为新兴范式,已在自然语言处理中广泛应用,但在KGC中的应用仍较有限。本文提出一种新方法,通过在上下文学习中引入图的拓扑结构与本体知识,显著提升补全性能。在归纳设置下(训练与测试节点无交集),利用本体推断缺失节点特征,作为大模型推理时的上下文线索。实验表明,该方法在ILPC-small和ILPC-large数据集上均优于现有基线。
原文摘要 · Abstract (English)
Knowledge graphs (KGs) are crucial for representing and reasoning over structured information, supporting a wide range of applications such as information retrieval, question answering, and decision-making. However, their effectiveness is often hindered by incompleteness, limiting their potential for real-world impact. While knowledge graph completion (KGC) has been extensively studied in the literature, recent advances in generative AI models, particularly large language models (LLMs), have introduced new opportunities for innovation. In-context learning has recently emerged as a promising approach for leveraging pretrained knowledge of LLMs across a range of natural language processing tasks and has been widely adopted in both academia and industry. However, how to utilize in-context learning for effective KGC remains relatively underexplored. We develop a novel method that incorporates topological information through in-context learning to enhance KGC performance. By integrating ontological knowledge and graph structure into the context of LLMs, our approach achieves strong performance in the transductive setting i.e., nodes in the test graph dataset are present in the training graph dataset. Furthermore, we apply our approach to KGC in the more challenging inductive setting, i.e., nodes in the training graph dataset and test graph dataset are disjoint, leveraging the ontology to infer useful information about missing nodes which serve as contextual cues for the LLM during inference. Our method demonstrates superior performance compared to baselines on the ILPC-small and ILPC-large datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。