摘要
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.
作者
马江涛
Wang Yanjun
Chen Xueting
Qiao Yaqiong
Ma Jiangtao;Wang Yanjun;Chen Xueting;Qiao Yaqiong(College of Computer and Communication Engineering,Zhengzhou Universily of Lighl Industry,Zhengzhou 450002,P.R.China;State Key Laboratory of Mathematical Engineering and Advanced Computing,Zhengzhou 450002,P.R.China;School of Computer&Communication Engineering,University of Science and Technology Beijing,Beijing 100083,P.R.China;School of Information Engineering,North China University of W ater Resources and Electric Power,Zhengzhou 450046,P.R.China)
基金
Supported by the Henan Province Science and Technology Department Foundation(No.202102310237,192102210133,202102310295)
the Doctoral Research Fund of Zhengzhou University of Light Industry(No.2018BSJJ039)
the Internet Medical and Health Service Henan Collaborative Innovation Center Open Project Fund(No.IH2019006).
