计算机科学
公制(单位)
知识图
人工智能
图形
机器学习
图论
基于知识的系统
理论计算机科学
知识获取
数据挖掘
数据建模
度量空间
知识抽取
知识工程
算法设计
作者
X G Wang,Ke Yang,Jian Liu,Xianan Li,Rui Hua,Kuan Xu,Zixin Shu,Xuezhong Zhou
标识
DOI:10.1109/tkde.2026.3692238
摘要
Uncertainty is a fundamental aspect of human knowledge, widely present in various domains such as medicine, biology, and finance. Uncertain Knowledge Graph Completion (UKGC) tasks encompass both link prediction and confidence prediction. However, the inaccessibility of high-quality knowledge results in sparse knowledge graphs, where a large number of entities exhibit relatively sparse neighborhoods. This sparsity severely hinders the performance of few-shot UKGC models, which generally rely on neighborhood aggregation to enhance entity representations. In this study, we propose a Meta relation-aware Metric learning framework designed for few-shot UKGC, named MMUC. To mitigate neighbor sparsity, MMUC introduces a relation-centric paradigm that decouples representation enhancement from background graphs, integrating an uncertainty-driven similarity measure through a learnable confidence learner to achieve robust, non-linear fusion for joint link and confidence prediction. Extensive evaluations across multiple benchmarks demonstrate MMUC's superior performance through rigorous link and confidence prediction, ablation studies, and sparsity analysis, highlighting its particular resilience to neighbor sparsity in few-shot uncertain KGs. The source code can be accessed inhttps://github.com/sienna-wxy/MMUC.
科研通智能强力驱动
Strongly Powered by AbleSci AI