期刊
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
卷 33, 期 4, 页码 1348-1359出版社
IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2019.2941685
关键词
Knowledge engineering; Task analysis; Scalability; Standards; Knowledge based systems; Predictive models; Sampling methods; Rule learning; knowledge graphs
类别
资金
- Australian Research Council (ARC) [DP130102302]
This paper introduces a new approach, RLvLR, for learning rules from large knowledge graphs by using embedding in representation learning and a new sampling method; a new method, RLvLR-Stream, is developed for learning rules from streams of knowledge graphs; experimental results show that these methods perform well in both rule learning and link prediction tasks.
It is natural and effective to use rules for representing explicit knowledge in knowledge graphs. However, it is challenging to learn rules automatically from very large knowledge graphs such as Freebase and YAGO. This paper presents a new approach, RLvLR (Rule Learning via Learning Representations), to learning rules from large knowledge graphs by using the technique of embedding in representation learning together with a new sampling method. Based on RLvLR, a new method RLvLR-Stream is developed for learning rules from streams of knowledge graphs. Both RLvLR and RLvLR-Stream have been implemented and experiments conducted to validate the proposed methods regarding the tasks of rule learning and link prediction. Experimental results show that our systems are able to handle the task of rule learning from large knowledge graphs with high accuracy and outperform some state-of-the-art systems. Specifically, for massive knowledge graphs with hundreds of predicates and over 10M facts, RLvLR is much faster and can learn much more quality rules than major systems for rule learning in knowledge graphs such as AMIE+. In the setting of knowledge graph streams, RLvLR-Stream significantly improved RLvLR for both rule learning and link prediction.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据