arXiv:2608.28642cs.AIcs.CE2026-08综述

构建带治理机制的知识图谱,让每条知识都有来源和审核记录。

From Extraction to Governed Memory: Multi-Agent Knowledge Graph Construction with Domain-Expert Review

  • 用多智能体框架自动划分领域、分配知识归属并审核证据
  • 在SciERC上严格三元组准确率提升47%,在MuSiQue上超越GraphRAG超9分
  • 适合需要可追溯、高可信知识系统的科研与企业应用

当前代理系统使用的知识图谱通常只是扁平的三元组存储,缺乏对事实归属、采纳原因及下游使用方式的记录。我们主张,可靠的代理知识系统必须将治理作为图谱构建的核心环节。为此,我们提出MAGG——一种基于多智能体的受控知识图谱构建框架,引入显式的治理决策机制,保障知识共享的可靠性和可信度。首先由领域分类器从文档内容中直接推导实体与关系类型,支持开放世界设置而无需固定模式。候选三元组被分配给领域所有者,经证据审查后通过治理决策确认,并附带审计元数据存入图谱。问答阶段复用相同的归属结构,查询被路由至领域专家而非统一检索。评估显示:在SciERC上,MAGG的严格三元组F1提升47%,映射三元组F1提升51%;盲评120个三元组发现受控三元组更常有来源支持,且修订三元组100%得到支持。在MuSiQue上,相比Microsoft GraphRAG,MAGG高出9.0分精确匹配与11.2分词符F1。

原文摘要 · Abstract (English)

Knowledge graphs used by agentic systems are often treated as flat stores of extracted triples, with little record of who owns a fact, why it was admitted, or how it should be used downstream. We argue that reliable agentic knowledge systems require governance as an essential component of graph construction to bridge this gap. We propose MAGG, a principled multi-agent framework for constructing Governed Knowledge Graphs that introduces explicit governance decisions for reliable and trustworthy knowledge sharing. A domain classifier first induces entity and relation types directly from document content, enabling operation in open-world settings without fixed schemas. Candidate triples are assigned to domain owners, reviewed against supporting evidence, admitted through governance decisions, and stored with audit metadata. The same ownership structure is reused during question answering, where queries are routed to domain-specific graph experts rather than answered through undifferentiated retrieval. Our evaluation demonstrates MAGG's effectiveness: On SciERC, MAGG improves strict triple F1 by 47% and mapped triple F1 by 51% over flat insertion. A blinded review of 120 triples finds governed-only triples more often source-supported than flat-only ones, and revised triples supported in 100% of cases. Finally, on MuSiQue, MAGG outperforms Microsoft GraphRAG by 9.0 exact-match points and 11.2 token-F1 points.

知识图谱多智能体治理机制可信推理

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