Skip navigation
Skip navigation

Active knowledge graph completion

Ghiasnezhad Omran, Pouya; Taylor, Kerry; Rodríguez Méndez, Sergio; Haller, Armin


Knowledge graphs (KGs) proliferating on theWeb are known to be incomplete. Much research has been proposed for automatic com- pletion, sometimes by rule learning, that scales well. All existing methods learn closed rules. Here we introduce open path (OP) rules and present a novel algorithm, oprl, for learning them. While closed rules are used to complete a KG by answering given queries, OP rules identify the incom- pleteness of a KG by inducing such queries to ask. We use adaptations of...[Show more]

CollectionsANU Research Publications
Date published: 2020
Type: Conference paper
Source: Proceedings of the 19th International Semantic Web Conference on Demos and Industry Tracks (ISWC)
Access Rights: Open Access


File Description SizeFormat Image
paper522.pdf435.8 kBAdobe PDFThumbnail

This item is licensed under a Creative Commons License Creative Commons

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator