A Multi-Hop Link Prediction Approach Based on Reinforcement Learning in Knowledge Graphs

2018 11th International Symposium on Computational Intelligence and Design (ISCID)(2018)

引用 2|浏览32
暂无评分
摘要
Knowledge Graphs (KGs), both manually and automatically constructed, are far from complete. Recently, Knowledge Graph Completion (KGC) has been receiving a great deal of attention. Link prediction is a key task in KGC. In this work, we research multi-hop link prediction based on reinforcement learning (RL) in KGs. More specifically, we propose a novel RL framework for learning more accurate link prediction models: we frame link prediction problem in KGs as an inference problem in probabilistic graphical model (PGM) and use maximum entropy RL to maximize the expected return. Our experimental evaluations show that our proposed method performs well on FB15K-237 and NELL-995 datasets.
更多
查看译文
关键词
Reinforcement learning,multi-hop link prediction,knowledge graph completion,probabilistic graphical model
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要