返回
Rule-based hidden relation recognition for large scale knowledge graphs
DOI:10.1016/j.patrec.2019.03.012.png)
摘要
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.
Keyword:
Hidden relation
Knowledge graph
Reasoning
OWL2 RL
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
DBpedia - A large-scale, multilingual knowledge base extracted from WikipediaDBpedia-从维基百科中提取的大规模多语言知识库
SEMANTIC WEB
IF2.9
Bit selection via walks on graph for hash-based nearest neighbor search基于哈希的最近邻搜索中通过在图上行走的位选择
NEUROCOMPUTING
IF6.5
没有更多内容

