Reasoning Through Memorization: Nearest Neighbor Knowledge Graph Embeddings

arXiv (Cornell University)(2022)

引用 0|浏览0
暂无评分
摘要
Previous knowledge graph embedding approaches usually map entities to representations and utilize score functions to predict the target entities, yet they typically struggle to reason rare or emerging unseen entities. In this paper, we propose kNN-KGE, a new knowledge graph embedding approach with pre-trained language models, by linearly interpolating its entity distribution with k-nearest neighbors. We compute the nearest neighbors based on the distance in the entity embedding space from the knowledge store. Our approach can allow rare or emerging entities to be memorized explicitly rather than implicitly in model parameters. Experimental results demonstrate that our approach can improve inductive and transductive link prediction results and yield better performance for low-resource settings with only a few triples, which might be easier to reason via explicit memory. Code is available at https://github.com/zjunlp/KNN-KG.
更多
查看译文
关键词
nearest neighbor knowledge graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络