面向知识增强的动态关系修复
Dynamic Relation Repairing for Knowledge Enhancement
摘要:
动态关系修复旨在有效地验证和修复知识图谱增强(KGE)的实例,其中KGE从非结构化数据中捕获缺失的关系并将噪声事实引入知识图谱。随着非结构化数据的大量涌现,人们要求在将新的RDF元组添加到知识库之前对其进行在线清洗。为了清除噪声RDF元组,图约束处理是一种常见但棘手的方法。另外,当向知识图谱添加新元组时,将创建新的图模式,而图约束的显式发现也是棘手的。因此,尽管动态关系修复具有不幸的困难,但它是在快速增长的非结构化数据下有效增强知识图谱的必要途径。基于此,本文建立了一种动态修复增强结构,分析了其对基本操作的难度。为了确保动态修复和验证,我们引入了隐式图约束,近似图匹配,并根据本地化的图形模式的链接预测。为了有效地验证和修复RDF元组,我们进一步研究了图约束处理的冷启动问题。在真实数据集上的实验结果表明,该方法可以动态有效地捕获和修复具有错误关系标签的实例。
英文摘要:
Dynamic relation repair aims to efficiently validate and repair the instances for knowledge graph enhancement (KGE), where KGE captures missing relations from unstructured data and leads to noisy facts to the knowledge graph. With the prosperity of unstructured data, an online approach is asked to clean the new RDF tuples before adding them to the knowledge base. To clean the noisy RDF tuples, graph constraint processing is a common but intractable approach. Plus, when adding new tuples to the knowledge graph, new graph patterns would be created, whereas the explicit discovery of graph constraints is also intractable. Therefore, although the dynamic relation repair has an unfortunate hardness, it is a necessary approach for enhancing knowledge graphs effectively under the fast-growing unstructured data. Motivated by this, we establish a dynamic repairing and enhancing structure to analyze its hardness on basic operations. To ensure dynamic repair and validation, we introduce implicit graph constraints, approximate graph matching, and linkage prediction based on localized graph patterns. To validate and repair the RDF tuples efficiently, we further study the cold start problems for graph constraint processing. Experimental results on real datasets demonstrate that our proposed approach can capture and repair instances with wrong relation labels dynamically and effectively.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。