NGDcrm:a numeric graph dependency-based conflict resolution method for knowledge graph

• 作 者: Ma Jiangtao Wang Yanjun Chen Xueting Qiao Yaqiong
• 机 构: College of Computer and Communication Engineering,Zhengzhou University of Light Industry,Zhengzhou 4
• 出 处: 高技术通讯（英文版）
• 发表日期: 2021年2期
• 关键词: dependency graph knowledge conflict resolution knowledge graph(KG) nu-meric grap

Knowledge graph(KG)conflict resolution is to solve knowledge conflicts problem in the con-struction 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.NGD-crm utilizes the dependency graph to perform arithmetic calculation and predicate comparison of nu-merical 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 numer-ical graph dependencies to detect and correct the wrong facts in the KG based on the extracted fea-tures.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.