.png){kind=icon}
Return
Rule-based hidden relation recognition for large scale knowledge graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2019.03.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Knowledge graphs usually contain much implicit semantic information, which need to be further recognized through semantic inference. However, existing approaches are either not good at processing large scale data or not powerful enough for digging hidden relations thoroughly. This paper proposes a distributed OWL2 RL/RDF rule-based theory closure reasoning algorithm, named KGRL, for recognizing hidden relations in knowledge graphs. Since hidden relations derived from knowledge graph usually contain a lot of redundancies, a redundancy reduction strategy is proposed for eliminating redundant data without effect further queries on the knowledge graph. Extensive experiments and comprehensive evaluations are conducted. The experimental result shows that KGRL recognizes more hidden relations efficiently than Cichlid at different scales of the LUBM benchmark, and it only has a constant increase of runtime. Further more, the redundancy reduction strategy effectively reduces the size of the resulting knowledge graphs of hidden relation recognition on both synthetic and real-world knowledge graphs. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Hidden relation
Knowledge graph
Reasoning
OWL2 RL
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
8.0K
Citations:
1.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
no more
no more