Author Login Chief Editor Login Reviewer Login Editor Login Remote Office

Computer Engineering ›› 2026, Vol. 52 ›› Issue (4): 122-130. doi: 10.19678/j.issn.1000-3428.0069984

• Computational Intelligence and Pattern Recognition • Previous Articles     Next Articles

Commonsense Knowledge Graph Completion Method Based on Relation-Constrained Contrastive Learning

HE Hongguang1,2, XIAN Yantuan1,2, XIANG Yan1,2,*   

  1. 1. School of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, Yunnan, China
    2. Yunnan Key Laboratory of Artificial Intelligence, Kunming University of Science and Technology, Kunming 650500, Yunnan, China
  • Received:2024-06-11 Revised:2024-10-09 Online:2026-04-15 Published:2024-12-09
  • Contact: XIANG Yan

基于关系约束对比学习的常识知识图谱补全方法

和红光1,2, 线岩团1,2, 相艳1,2,*   

  1. 1. 昆明理工大学信息工程与自动化学院, 云南 昆明 650500
    2. 昆明理工大学云南省人工智能重点实验室, 云南 昆明 650500
  • 通讯作者: 相艳
  • 作者简介:

    和红光, 男, 硕士研究生, 主研方向为自然语言处理、知识图谱

    线岩团,副教授

    相艳(通信作者),副教授

  • 基金资助:
    国家自然科学基金重点项目(U23A20388); 国家自然科学基金重点项目(U21B2027); 云南省青年学术和技术带头人后备人才计划(202305AC160063); 云南省重大科技专项计划项目(202202AD080004); 云南省重大科技专项计划项目(202202AD080003)

Abstract:

Knowledge graph completion aims to address the problems of knowledge deficiency and incompleteness, by predicting missing entities or relationships in a knowledge graph. Compared to traditional knowledge graphs, commonsense knowledge graphs are typically sparser, making them insufficient for representing entities solely based on structural information. Therefore, some studies enrich commonsense knowledge graphs by utilizing semantic representations in addition to structural information. However, these methods typically focus only on the semantic representation of individual entities and ignore the semantic associations between entity sets. To address this issue, this study proposes a new method called relation-constrained contrastive learning for common-sense knowledge graph completion. First, the method uses relations to divide entities into different sets and selects positive and negative sample pairs from these sets for contrastive learning, to obtain the basic representations of the entities. It further learns comprehensive entity representations by constraining the similarity between individual entity semantic representations and the central representations of the sets to which the entities belong. The completion task is performed based on these comprehensive representations. Experiments on two public datasets show that the proposed model outperforms baseline models. Compared to the second-best model, CPNC, the proposed model improves the Mean Reciprocal Rank (MRR) by 1.09 and 2.48 percentage points and Hits@1 by 1.02 and 1.55 percentage points on the CN-100K and ATOMIC datasets, respectively.

Key words: commonsense knowledge graph, knowledge graph completion, contrastive learning, relation constraint, semantic representation

摘要:

知识图谱补全旨在通过预测知识图谱中缺失的实体或关系来解决知识缺失和不完整问题。与传统知识图谱相比, 常识知识图谱通常更加稀疏, 因此仅依靠结构信息来表征实体往往存在不足。为此, 现有研究在结构信息的基础上, 利用语义表征来丰富常识知识图谱, 但这些方法通常只关注单个实体的语义表征, 而忽视了实体集合的语义关联。针对该问题, 提出一种基于关系约束对比学习的常识知识图谱补全方法。首先, 利用关系将实体划分为不同的集合, 从集合中挑选正负样本对进行对比学习, 以获取实体的基础表征; 在此基础上, 以实体个体语义表征和实体所在集合中心表征之间的相似性为约束, 进一步学习实体的综合表征, 并基于该综合表征完成补全任务。在两个公共数据集CN-100K和ATOMIC上进行了实验, 结果表明该模型相比基线模型具有更优的性能: 相比次优模型CPNC, 该模型在两个数据集上平均倒数排名(MRR)值分别提升了1.09和2.48百分点, Hits@1值分别提升了1.02和1.55百分点。

关键词: 常识知识图谱, 知识图谱补全, 对比学习, 关系约束, 语义表征