Active knowledge graph completion

Pouya Ghiasnezhad Omran,Kerry Taylor,Sergio Rodriguez Mendez,Armin Haller

Information Sciences（2022）

引用 7|浏览24

暂无评分

摘要

Enterprise and public Knowledge Graphs (KGs) are known to be incomplete. Methods for automatic completion, sometimes by rule learning, scale well. While previous rule-based methods learn closed (non-existential) rules, we introduce Open Path (OP) rules that are constrained existential rules. We present a novel algorithm, OPRL, for learning OP rules.

查看译文

关键词

Existential rule learning,Knowledge graph completion,Rule learning,Knowledge graph

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要