DeepPath: A Reinforcement Learning Method for Knowledge Graph Reasoning
2017pp. 564–573
Citations Over TimeTop 1% of 2017 papers
Abstract
We study the problem of learning to reason in large scale knowledge graphs (KGs). More specifically, we describe a novel reinforcement learning framework for learning multi-hop relational paths: we use a policy-based agent with continuous states based on knowledge graph embeddings, which reasons in a KG vector space by sampling the most promising relation to extend its path. In contrast to prior work, our approach includes a reward function that takes the accuracy, diversity, and efficiency into consideration. Experimentally, we show that our proposed method outperforms a path-ranking based algorithm and knowledge graph embedding methods on Freebase and Never-Ending Language Learning datasets. 1
Related Papers
- → Bootstrapping Entity Alignment with Knowledge Graph Embedding(2018)520 cited
- → Online Updates of Knowledge Graph Embedding(2022)5 cited
- → Enriching Translation-Based Knowledge Graph Embeddings Through Continual Learning(2018)24 cited
- → Efficient parallel translating embedding for knowledge graphs(2017)18 cited
- → Knowledge Graph Embedding by Learning to Connect Entity with Relation(2018)4 cited