Triple Trustworthiness Measurement for Knowledge Graph

被引:55
作者
Jia, Shengbin [1 ]
Xiang, Yang [1 ]
Chen, Xiaojun [1 ]
机构
[1] Tongji Univ, Shanghai, Peoples R China
来源
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019) | 2019年
基金
中国国家自然科学基金;
关键词
Knowledge graph; trustworthiness; neural network; error detection; NETWORKS; DBPEDIA; BASE;
D O I
10.1145/3308558.3313586
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The Knowledge graph (KG) uses the triples to describe the facts in the real world. It has been widely used in intelligent analysis and applications. However, possible noises and conflicts are inevitably introduced in the process of constructing. And the KG based tasks or applications assume that the knowledge in the KG is completely correct and inevitably bring about potential deviations. In this paper, we establish a knowledge graph triple trustworthiness measurement model that quantify their semantic correctness and the true degree of the facts expressed. The model is a crisscrossing neural network structure. It synthesizes the internal semantic information in the triples and the global inference information of the KG to achieve the trustworthiness measurement and fusion in the three levels of entity level, relationship level, and KG global level. We analyzed the validity of the model output confidence values, and conducted experiments in the real-world dataset FB15K (from Freebase) for the knowledge graph error detection task. The experimental results showed that compared with other models, our model achieved significant and consistent improvements.
引用
收藏
页码:2865 / 2871
页数:7
相关论文
共 45 条
[1]  
[Anonymous], P 29 AAAI C ART INT
[2]  
[Anonymous], RUAN JIAN XUE BAO
[3]  
[Anonymous], J U ELECT SCI TECHNO
[4]  
[Anonymous], 1998, P 7 INT WORLD WID WE
[5]  
[Anonymous], P C ART INT AAAI 201
[6]  
[Anonymous], 1987, P 10 INT JOINT C ART
[7]  
[Anonymous], 2014, AAAI C ART INT
[8]  
[Anonymous], 2011, ICML
[9]  
[Anonymous], INT SEM WEB C
[10]  
[Anonymous], 2013, P INT C COMP LEARN R