基于加权知识源的知识图谱验证
Towards Knowledge Graphs Validation through Weighted Knowledge Sources
摘要:
个人助理和搜索引擎等应用程序的性能依赖于高质量的知识库,即知识图谱。为了确保它们的质量,一个重要的任务是知识验证,它测量KG的语句或三元组在语义上正确的程度。KG不可避免地包含不正确和不完整的语句,这可能会阻碍它们在业务应用程序中的采用,因为它们不值得信赖。在本文中,我们提出并实现了一个验证器,计算一个置信度得分的每一个三元组和实例KG。计算的分数是基于在不同的加权知识源中找到相同的实例并比较它们的特征。我们通过将其结果与基线验证进行比较来评估我们的方法。我们的研究结果表明,我们可以验证KG的f-测量值至少为75%。在时间方面,Validator在大约15分钟内执行了2530个实例的验证。此外,我们给出了更好的架构来解决KG验证的见解和方向。
英文摘要:
The performance of applications, such as personal assistants and search engines, relies on high-quality knowledge bases, a.k.a. Knowledge Graphs (KGs). To ensure their quality one important task is knowledge validation, which measures the degree to which statements or triples of KGs are semantically correct. KGs inevitably contain incorrect and incomplete statements, which may hinder their adoption in business applications as they are not trustworthy. In this paper, we propose and implement a Validator that computes a confidence score for every triple and instance in KGs. The computed score is based on finding the same instances across different weighted knowledge sources and comparing their features. We evaluate our approach by comparing its results against a baseline validation. Our results suggest that we can validate KGs with an f-measure of at least 75%. Time-wise, the Validator, performed a validation of 2530 instances in 15 minutes approximately. Furthermore, we give insights and directions toward a better architecture to tackle KG validation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。