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 pr...
