arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.03548cs.CL
收藏

基于概率案例推理的开放世界知识图谱补全

Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion

University of Massachusetts, Amherst, USA(马萨诸塞大学阿默斯特分校);Google Research, USA(谷歌研究院)

Rajarshi Das, Ameya Godbole, Nicholas Monath, Manzil Zaheer, Andrew McCallum

摘要:

基于案例的推理(CBR)系统通过检索与给定问题相似的“案例”来解决新问题。如果这样的系统可以实现高精度,它是有吸引力的,由于其简单性,可解释性和可扩展性。在本文中,我们证明了这样一个系统是可以实现的知识库(KBs)的推理。我们的方法预测属性的实体收集推理路径相似的实体在知识库中。我们的概率模型估计的可能性,路径是有效的回答查询有关给定的实体。我们的模型的参数可以有效地计算使用简单的路径统计,不需要迭代优化。我们的模型是非参数的,随着新的实体和关系添加到知识库中而动态增长。在几个基准数据集上,我们的方法显着优于其他规则学习方法,并执行最先进的基于嵌入的方法。此外,我们证明了我们的模型在“开放世界”环境中的有效性,新的实体以在线方式到达,显著优于最先进的方法,几乎匹配最好的离线方法。代码可在https://github.com/ameyagodbole/Prob-CBR获得

英文摘要:

A case-based reasoning (CBR) system solves a new problem by retrieving `cases' that are similar to the given problem. If such a system can achieve high accuracy, it is appealing owing to its simplicity, interpretability, and scalability. In this paper, we demonstrate that such a system is achievable for reasoning in knowledge-bases (KBs). Our approach predicts attributes for an entity by gathering reasoning paths from similar entities in the KB. Our probabilistic model estimates the likelihood that a path is effective at answering a query about the given entity. The parameters of our model can be efficiently computed using simple path statistics and require no iterative optimization. Our model is non-parametric, growing dynamically as new entities and relations are added to the KB. On several benchmark datasets our approach significantly outperforms other rule learning approaches and performs comparably to state-of-the-art embedding-based approaches. Furthermore, we demonstrate the effectiveness of our model in an "open-world" setting where new entities arrive in an online fashion, significantly outperforming state-of-the-art approaches and nearly matching the best offline method. Code available at https://github.com/ameyagodbole/Prob-CBR

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑