文章摘要
Ma Jiangtao (马江涛)*,Wang Yanjun* **,Chen Xueting***,Qiao Yaqiong****.[J].高技术通讯(英文),2021,27(2):153~162
NGDcrm:a numeric graph dependency-based conflict resolution method for knowledge graph
  
DOI:10.3772/j.issn.1006-6748.2021.02.006
中文关键词: 
英文关键词: dependency graph, knowledge conflict resolution, knowledge graph(KG), numeric graph dependency(NGD)
基金项目:
Author NameAffiliation
Ma Jiangtao (马江涛)* (*College of Computer and Communication Engineering, Zhengzhou University of Light 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 Water Resources and Electric Power, Zhengzhou 450046, P.R.China) 
Wang Yanjun* ** (*College of Computer and Communication Engineering, Zhengzhou University of Light 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 Water Resources and Electric Power, Zhengzhou 450046, P.R.China) 
Chen Xueting*** (*College of Computer and Communication Engineering, Zhengzhou University of Light 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 Water Resources and Electric Power, Zhengzhou 450046, P.R.China) 
Qiao Yaqiong**** (*College of Computer and Communication Engineering, Zhengzhou University of Light 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 Water Resources and Electric Power, Zhengzhou 450046, P.R.China) 
Hits: 216
Download times: 220
中文摘要:
      
英文摘要:
      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.
View Full Text   View/Add Comment  Download reader
Close

分享按钮