资源分类
》 资源 》论文》Anytime Bottom-Up Rule Learning for Knowledge Graph Completion

Anytime Bottom-Up Rule Learning for Knowledge Graph Completion

2019-10-08 | |  76 |   53 |   0
Abstract We propose an anytime bottom-up technique for learning logical rules from large knowledge graphs. We apply the learned rules to predict candidates in the context of knowledge graph completion. Our approach outperforms other rule-based approaches and it is competitive with current state of the art, which is based on latent representations. Besides, our approach is significantly faster, requires less computational resources, and yields an explanation in terms of the rules that propose a candidate

上一篇：Action Space Learning for Heterogeneous User Behavior Prediction

下一篇：ARMIN: Towards a More Efficient and Light-weight Recurrent Memory Network

用户评价
全部评价

热门资源

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Rating-Boosted La...

    The performance of a recommendation system reli...

  • Hierarchical Task...

    We extend hierarchical task network planning wi...