Reasoning Through Memorization: Nearest Neighbor Knowledge Graph Embeddings
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction
Predicate-Conditional Conformalized Answer Sets for Knowledge Graph Embeddings
On Large-scale Evaluation of Embedding Models for Knowledge Graph Completion
Predicting missing annotations in Gene Ontology with Knowledge Graph Embeddings and True Path Rule
Parallel Training of Knowledge Graph Embedding Models: A Comparison of Techniques
Jointly Non-Sampling Learning for Knowledge Graph Enhanced Recommendation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.