Active Knowledge Graph Completion
Knowledge Graphs (KGs) proliferating on the Web are well known to be incomplete. Much research has been proposed for automatic completion, sometimes by rule learning, that is known to scale well. All existing methods learn closed rules. In this paper, we introduce open path (OP) rules and present a novel algorithm, OPRL, for learning OP rules. While CP rules complete a KG by answering given queries, OP rules identify the incompleteness of a KG by generating such queries. For our learning to...[Show more]
|Collections||ANU Research Publications|
|Access Rights:||Open Access|
|AKGC.pdf||463.66 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.