用全局视角构建知识图谱,让大模型更懂上下文关联。
Graphusion: A RAG Framework for Knowledge Graph Construction with a Global Perspective
- 通过主题建模筛选核心实体,再用大模型提取三元组。
- 实体合并与冲突消解后,三元组准确率提升至2.92/3。
- 适合教育、NLP等需结构化知识的场景,可直接落地。
知识图谱在人工智能中至关重要,广泛应用于问答等下游任务。传统构建方式依赖领域专家,耗时费力。现有基于大语言模型的方法多从单句出发,缺乏全局融合能力。本文提出Graphusion,一种零样本知识图谱构建框架,包含三步:第一步用主题建模提取种子实体,确保图谱相关性;第二步用LLM进行候选三元组抽取;第三步设计新型融合模块,实现全局视图下的实体合并、冲突解决与新三元组发现。实验显示,其在实体抽取和关系识别上分别达2.92和2.37分(满分3分)。我们进一步将Graphusion应用于自然语言处理领域,构建了包含6个任务、共1200个问答对的TutorQA基准。基于该框架构建的知识图谱,在子图补全任务上准确率提升9.2%。
原文摘要 · Abstract (English)
Knowledge Graphs (KGs) are crucial in the field of artificial intelligence and are widely used in downstream tasks, such as question-answering (QA). The construction of KGs typically requires significant effort from domain experts. Large Language Models (LLMs) have recently been used for Knowledge Graph Construction (KGC). However, most existing approaches focus on a local perspective, extracting knowledge triplets from individual sentences or documents, missing a fusion process to combine the knowledge in a global KG. This work introduces Graphusion, a zero-shot KGC framework from free text. It contains three steps: in Step 1, we extract a list of seed entities using topic modeling to guide the final KG includes the most relevant entities; in Step 2, we conduct candidate triplet extraction using LLMs; in Step 3, we design the novel fusion module that provides a global view of the extracted knowledge, incorporating entity merging, conflict resolution, and novel triplet discovery. Results show that Graphusion achieves scores of 2.92 and 2.37 out of 3 for entity extraction and relation recognition, respectively. Moreover, we showcase how Graphusion could be applied to the Natural Language Processing (NLP) domain and validate it in an educational scenario. Specifically, we introduce TutorQA, a new expert-verified benchmark for QA, comprising six tasks and a total of 1,200 QA pairs. Using the Graphusion-constructed KG, we achieve a significant improvement on the benchmark, for example, a 9.2% accuracy improvement on sub-graph completion.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。