Author Login Chief Editor Login Reviewer Login Editor Login Remote Office

Computer Engineering ›› 2025, Vol. 51 ›› Issue (3): 131-143. doi: 10.19678/j.issn.1000-3428.0069129

• Artificial Intelligence and Pattern Recognition • Previous Articles     Next Articles

Knowledge Graph Completion Based on Logical Rules and Graph Neural Network

LIU Chunyu, CHEN Qingfeng*(), MO Shaocong, XIE Ze   

  1. School of Computer, Electronics and Information, Guangxi University, Nanning 530004, Guangxi, China
  • Received:2023-12-29 Online:2025-03-15 Published:2024-05-09
  • Contact: CHEN Qingfeng

基于逻辑规则和图神经网络的知识图谱补全

刘春雨, 陈庆锋*(), 莫少聪, 谢泽   

  1. 广西大学计算机与电子信息学院, 广西 南宁 530004
  • 通讯作者: 陈庆锋
  • 基金资助:
    国家自然科学基金(61963004)

Abstract:

Knowledge Graph Completion(KGC) aims to utilize the existing knowledge in a Knowledge Graph(KG) to derive new facts. This process is pivotal in several tasks and domains and has garnered increasing attention from researchers. However, most existing KGC methods focus on modeling fact triples in a KG without fully considering deep semantics or associations between entities and relationships in the KG. To address this issue, logical rules can be used to reflect the implicit associations between relationships in a KG. The semantic nature of the KG implies that higher-order neighborhoods around fact triples contain deep semantic information. Therefore, to fully explore the inherent semantics and correlations of entities and relationships in KGs, this study proposes a novel model for a KGC based on logical rules and Graph Neural Networks(GNNs). The framework first employs an automatic rule learning process based on the efficient Expectation-Maximization(EM) iterative optimization algorithm. It then performs joint embedding training on the obtained high-quality logical rules, entities, and relationships in the KG to model the complex relationship patterns in the KG and improve the generalization of the embedding representation. Subsequently, attention embedding propagation is performed by simultaneously considering the importance of logic rules and triples to aggregate higher-order neighborhood information, and entity and relation embedding representations incorporating deep semantics and associations are obtained for the KGC. In this study, extensive experiments are conducted on four public datasets for link prediction, and the results demonstrate the effectiveness of the proposed model.

Key words: Knowledge Graph(KG), Knowledge Graph Completion(KGC), logical rules, Graph Neural Network(GNN), link prediction

摘要:

知识图谱补全旨在利用知识图谱中已有的知识推导出新的事实, 在多个任务和领域发挥重要作用, 引起研究者越来越多的关注。然而现有的知识图谱补全方法大多专注于对知识图谱中的事实三元组进行建模, 未充分考虑知识图谱中实体和关系之间所蕴涵的深层语义和关联。为了解决这个问题, 使用逻辑规则反映知识图谱中关系之间的隐含关联, 而知识图谱语义网络的本质决定了事实三元组周围高阶邻域中包含着深层语义信息。因此, 为了挖掘知识图谱中实体和关系的内在语义和关联, 提出一种基于逻辑规则和图神经网络(GNN)进行知识图谱补全模型。首先基于高效期望最大化(EM)迭代优化算法进行规则自动学习, 将得到的高质量逻辑规则与知识图谱中的实体和关系进行联合嵌入训练, 以实现对知识图谱中复杂关系模式的建模, 并提高嵌入表示的泛化性。同时, 考虑逻辑规则和三元组的重要性进行注意力嵌入传播, 以聚合高阶邻域信息, 最终得到融合深层语义和关联的实体、关系嵌入表示用于知识图谱补全。在4个公开数据集上针对链接预测任务进行实验, 实验结果证明了所提出模型的有效性。

关键词: 知识图谱, 知识图谱补全, 逻辑规则, 图神经网络, 链接预测