A Novel Time Constraint-Based Approach for Knowledge Graph Conflict Resolution

• Published in: Applied sciences Vol. 9; no. 20; p. 4399
• Main Authors: Wang, Yanjun, Qiao, Yaqiong, Ma, Jiangtao, Hu, Guangwu, Zhang, Chaoqin, Sangaiah, Arun Kumar, Zhang, Hongpo, Ren, Kai
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.10.2019
• Subjects: Conflict resolution; knowledge conflict resolution; knowledge graph; Knowledge representation; Methods; Neural networks; neural recurrent network; Ontology; Probability distribution; Queries; Semantics; United States > US
• ISSN: 2076-3417; 2076-3417
• DOI: 10.3390/app9204399

Knowledge graph conflict resolution is a method to solve the knowledge conflict problem in constructing knowledge graphs. The existing methods ignore the time attributes of facts and the dynamic changes of the relationships between entities in knowledge graphs, which is liable to cause high error rates in dynamic knowledge graph construction. In this article, we propose a knowledge graph conflict resolution method, knowledge graph evolution algorithm based on deep learning (Kgedl), which can resolve facts confliction with high precision by combing time attributes, semantic embedding representations, and graph structure features. Kgedl first trains the semantic embedding vector through the relationships between entities. Then, the path embedding vector is trained from the graph structures of knowledge graphs, and the time attributes of entities are combined with the semantic and path embedding vectors. Finally, Kgedl uses a recurrent neural network to make the inconsistent facts appear in the dynamic evolution of the knowledge graph consistent. A large number of experiments on real datasets show that Kgedl outperforms the state-of-the-art methods. Especially, Kgedl achieves 23% higher performance than the classical method numerical Probabilistic Soft Logic (nPSL).in the metric HITS@10. Also, extensive experiments verified that our proposal possess better robustness by adding noise data.