• 融合逻辑规则和推理路径嵌入的知识图谱推理

    Knowledge graph reasoning integrating logical rules and reasoning path embedding

    • 现有的基于知识图谱嵌入的知识推理一般是通过将实体和关系嵌入到低维向量中来预测缺失的事实。但该方法仅使用零阶逻辑来编码现有的三元组,无法应用一阶逻辑规则,虽然融合逻辑规则嵌入可解决该问题,但又带来逻辑规则脆弱性的问题。为此,提出了一种逻辑规则和推理路径的联合嵌入方法。通过在统一的嵌入空间中联合表示逻辑规则和路径,从现有的三元组和horn规则中联合表示实体、关系和学习逻辑规则,通过给定的逻辑规则,使用融合实体对关系路径的信度度量的游走策略生成相应的路径并省略掉中间实体,得到高度关联路径集,来补充实体对之间的语义关系,和规则头关系进行相似度计算,以此得到路径关联嵌入分数。此外,在优化过程中还考虑了每个规则的置信度,以保证规则嵌入的可用性。最后,基于4个标准知识图谱数据集上所进行的大量实验结果,表明该方法可以有效缓解逻辑的脆弱性问题,并提升了推理性能,与次优模型相比,在Kinship数据集上Hits@10指标最大提升了2.0%,在UML数据集上MRR指标最大提升了2.2%。

       

      Abstract: The existing knowledge inference based on knowledge graph embedding is generally to predict missing facts by embedding entities and relations into low-dimensional vectors. However, this method only uses zero-order logic to encode existing triples and cannot apply first-order logic rules. Although the integration of logical rules embedding can solve this problem, it also brings the problem of vulnerability of logical rules. Therefore, a joint embedding method of logical rules and inference paths is proposed in this paper. By jointly representing logical rules and paths in a unified embedding space, entities, relations, and learning logic rules are jointly represented from existing triples and horn rules. According to a given logical rule, we generate corresponding paths by using a walk strategy which integrates the confidence measure of the entity pair relationship path, omits intermediate entities, and obtains a highly correlated path set to supplement the semantic relationship between entity pairs. We also perform similarity calculations with the rule head relationship to obtain path associates embedding scores. In addition, during the optimization process, we also consider the confidence of each rule to ensure the usability of rule embedding. Finally, based on a large number of experimental results on four standard knowledge graph datasets, it was demonstrated that this method can effectively alleviate the vulnerability of logic and improve inference performance. Compared with suboptimal models, it achieves a maximum improvement of 2.0% in Hits@10 on the Kinship dataset and a maximum improvement of 2.2% in MRR on the UML dataset.

       

    /

    返回文章
    返回