arXiv:2110.12341
공식 코드 · Papers with Code
Scalable knowledge base completion with superposition memories
원문 초록
We present Harmonic Memory Networks (HMem), a neural architecture for knowledge base completion that models entities as weighted sums of pairwise bindings between an entity's neighbors and corresponding relations. Since entities are modeled as aggregated neighborhoods, representations of unseen entities can be generated on the fly. We demonstrate this with two new datasets: WNGen and FBGen. Experiments show that the model is SOTA on benchmarks, and flexible enough to evolve without retraining as the knowledge graph grows.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs
DELE: Deductive $\mathcal{EL}^{++} \thinspace $ Embeddings for Knowledge Base Completion
Do LLMs Really Adapt to Domains? An Ontology Learning Perspective
Pre-training and Diagnosing Knowledge Base Completion Models
Knowledge Base Completion for Long-Tail Entities
Lattice-preserving $\mathcal{ALC}$ ontology embeddings with saturation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.