Irreflexive and Hierarchical Relations as Translations
We consider the problem of embedding entities and relations of knowledge bases in low-dimensional vector spaces. Unlike most existing approaches, which are primarily efficient for modeling equivalence relations, our approach is designed to explicitly model irreflexive relations, such as hierarchies, by interpreting them as translations operating on the low-dimensional embeddings of the entities. Preliminary experiments show that, despite its simplicity and a smaller number of parameters than previous approaches, our approach achieves state-of-the-art performance according to standard evaluation protocols on data from WordNet and Freebase.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Appendix for: Cut-free Calculi and Relational Semantics for Temporal STIT logics
This paper is an appendix to the paper "Cut-free Calculi and Relational Semantics for Temporal STIT logics" by Berkel and Lyon, 2019. It provides the completeness proof for the basic STIT logic Ldm (relative to irreflexi…
LogicENN: A Neural Based Knowledge Graphs Embedding Model with Logical Rules
Knowledge graph embedding models have gained significant attention in AI research. Recent works have shown that the inclusion of background knowledge, such as logical rules, can improve the performance of embeddings in d…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsLink Prediction+1New Solution based on Hodge Decomposition for Abstract Games
This paper proposes Hodge Potential Choice (HPC), a new solution for abstract games with irreflexive dominance relations. This solution is formulated by involving geometric tools like differential forms and Hodge decompo…
LogicENN: A Neural Based Knowledge Graphs Embedding Model with Logical Rules
Knowledge graph embedding models have gained significant attention in AI and NLP research. Recent works have shown that the inclusion of background knowledge, such as logical rules, can improve the performance of embeddi…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsLink Prediction+1Cut-free Calculi and Relational Semantics for Temporal STIT Logics
We present cut-free labelled sequent calculi for a central formalism in logics of agency: STIT logics with temporal operators. These include sequent systems for Ldm, Tstit and Xstit. All calculi presented possess essenti…