融合子图信息和规则路径的不确定知识图谱补全模型
CSTR:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

国家自然科学基金(62066038); 宁夏自然科学基金(2024AAC03098); 宁夏全职引进高层次人才科研启动项目(2023BSB03066)


Uncertain Knowledge Graph Completion Model Integrating Subgraph Information and Rule Path
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    随着不确定知识图谱(uncertain knowledge graph, UKG)在开放世界知识表示中的广泛应用, 其内部所建模的概率型关系日益复杂. 仅依赖嵌入表示或简单的模式匹配方法, 已难以满足对高质量推理结果的需求. 因此, 引入高置信、可解释的规则挖掘机制, 对于提升UKG的推理能力与知识可解释性具有重要意义. 为此本文提出了一种基于BERT语义建模与结构路径规则挖掘的不确定知识图谱补全模型UBERT-RM (uncertain knowledge graph BERT-rule mining). UBERT-RM构建了一个端到端的统一框架, 将子图建模、路径生成与置信度预测有机融合于一体. 模型利用BERT提取三元组的上下文语义表征, 路径生成模块采用Transformer解码器结构, 以自回归方式逐步生成高置信度的关系路径. 规则解析模块中引入动态置信度阈值机制, 对节点进行筛选与解析, 确保最终的推理路径在保持语义连贯的同时具备良好的可信度与可解释性. 在置信度预测部分, 模型将生成的规则与目标三元组共同编码, 通过多头自注意力机制进行深层语义交互与信息聚合, 并引入多层感知机实现对尾实体置信度的回归建模, 从而完成从路径挖掘到置信度预测的闭环推理过程. 在CN15k和NL27k数据集上的实验结果表明, UBERT-RM在链接预测任务中的效果都达到了最佳.

    Abstract:

    With the widespread application of uncertain knowledge graph (UKG) in open-world knowledge representation, the probabilistic relations they model have become increasingly complex. Sole reliance on embedding representations or simple pattern-matching methods is now insufficient to meet the demand for high-quality reasoning results. Therefore, the introduction of high-confidence, interpretable rule mining mechanisms is essential for enhancing both the reasoning capability and knowledge interpretability of UKGs. To this end, an uncertain knowledge graph completion model named UBERT-RM (uncertain knowledge graph BERT-rule mining) is proposed, which integrates BERT-based semantic modeling with structural path rule mining. UBERT-RM constructs a unified end-to-end framework that organically combines subgraph modeling, path generation, and confidence prediction. Contextual semantic representations of triples are extracted using BERT, while the path generation module employs a Transformer decoder structure to autoregressively generate high-confidence relation paths. In the rule parsing module, a dynamic confidence threshold mechanism is introduced to filter and parse nodes, ensuring that the final reasoning paths remain semantic coherence while achieving high reliability and interpretability. For confidence prediction, the generated rules and target triples are jointly encoded, followed by deep semantic interaction and information aggregation through a multi-head self-attention mechanism. A multilayer perceptron is then employed to perform regression modeling of the tail-entity confidence, thereby completing a closed-loop reasoning process from path mining to confidence prediction. Experimental results on the CN15k and NL27k datasets demonstrate that the proposed UBERT-RM achieves state-of-the-art performance on the link prediction task.

    参考文献
    相似文献
    引证文献
引用本文

蒋娅娅,李贯峰,王世卓,尹仁蕊.融合子图信息和规则路径的不确定知识图谱补全模型.计算机系统应用,,():1-13

复制
分享
相关视频

文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2025-09-28
  • 最后修改日期:2025-11-03
  • 录用日期:
  • 在线发布日期: 2026-03-02
  • 出版日期:
文章二维码
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62661041 传真: Email:csa@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号