Task-driven cleaning and pruning of noisy knowledge graph

Many knowledge graphs, especially those that are collaboratively or automatically generated, are prone to noise and cross-domain entries, which can impede domain-specific applications. Existing methods for pruning inaccurate or out-of-domain information from knowledge graphs often rely on topological graph-pruning strategies. However, these approaches have two major drawbacks: they may discard logical structure and semantic information, and they allow multiple inheritance. To address these limitations, this study introduces KGPruning, which is a novel approach that can effectively clean and prune noisy knowledge graphs by guiding tasks with a given set of concepts and automatically generating a domain-specific taxonomy. Specifically, KGPruning employs a graph hierarchy inference method that is based on the Agony model to precisely identify and eliminate noisy entries while striving to preserve the underlying hierarchy of semantic relations as much as possible. Furthermore, to establish a tree-structured taxonomy, KGPruning integrates semantic relations and structural characteristics to effectively eliminate out-of-domain informa-tion and multiple inheritance. Through extensive experimental evaluations conducted on open benchmark datasets as well as large-scale real-world problems, the superior performance of KGPruning over state-of-the-art methods is demonstrated on the task of pruning noisy knowledge graphs.