期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
NGDcrm:a numeric graph dependency-based conflict resolution method for knowledge graph 被引量:1
1
作者 Ma Jiangtao Wang Yanjun +1 位作者 Chen Xueting Qiao Yaqiong 《High Technology Letters》 EI CAS 2021年第2期153-162,共10页
Knowledge graph(KG)conflict resolution is to solve knowledge conflicts problem in the construction of KG.Aiming at the problem of KG conflict resolution,a KG conflict resolution algorithm NGDcrm is proposed,which is a... Knowledge graph(KG)conflict resolution is to solve knowledge conflicts problem in the construction of KG.Aiming at the problem of KG conflict resolution,a KG conflict resolution algorithm NGDcrm is proposed,which is a numeric graph dependency-based conflict resolution method.NGDcrm utilizes the dependency graph to perform arithmetic calculation and predicate comparison of numerical entity knowledge in the KG.NGDcrm first uses a parallel segmentation method to segment the KG;then,it extracts the features of the KG according to KG embedding;finally,it uses numerical graph dependencies to detect and correct the wrong facts in the KG based on the extracted features.The experimental results on real data show that NGDcrm is better than the state-of-the-art knowledge conflict resolution method.Among them,the AUC value of NGDcrm on the DBpedia dataset is 15.4%higher than the state-of-the-art method. 展开更多
关键词 dependency graph knowledge conflict resolution knowledge graph(KG) numeric graph dependency(NGD)
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部