Restricting the Spurious Growth of Knowledge Graphs by Using Ontology Graphs

Abstract

Knowledge Graphs have demonstrated a real advantage in knowledge representation, leveraging graphs NoSQL structures and schema-less technology, which offers superior comprehension, knowledge representation, interpretation, and reasoning. The problem is that current methods for Knowledge Graph embedding rely on the topology of the graph, and essential information about entities and relations has not been fully employed, failing to utilize the graph's ontology to limit the spurious growth of edges, leading to inaccurate, misleading, and fabricated knowledge. This research aims to establish a method to restrict the spurious growth of host graph by imposing an upper bound on edge embedding using the claim's and the host's ontology graph. Through this research, a claim-ontology signature artifact was designed to facilitate open-environment KG completion. This artifact establishes the upper bound for the type of edges predicted by the link prediction algorithm, thus preventing the spurious growth of edges within the Knowledge Graph. Furthermore, the artifact was evaluated in the context of three use cases: host-guided embedding, claim-guided embedding, and topic-guided embedding, using a quantitative framework for design science evaluation. The main finding is that the spurious growth of edges can be limited by imposing an upper bound on the possible edge embedding using the claim's graph and the host ontology graph. A secondary finding is that the artifact could serve as an instrument to manage the ontology-topology tradeoff in Knowledge Graphs.