NagE: Non-Abelian Group Embedding for Knowledge Graphs
We demonstrated the existence of a group algebraic structure hidden in relational knowledge embedding problems, which suggests that a group-based embedding framework is essential for designing embedding models. Our theoretical analysis explores merely the intrinsic property of the embedding problem itself hence is model-independent. Motivated by the theoretical analysis, we have proposed a group theory-based knowledge graph embedding framework, in which relations are embedded as group elements, and entities are represented by vectors in group action spaces. We provide a generic recipe to construct embedding models associated with two instantiating examples: SO3E and SU2E, both of which apply a continuous non-Abelian group as the relation embedding. Empirical experiments using these two exampling models have shown state-of-the-art results on benchmark datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsSimilar Papers 제목 키워드 기반
Group Representation Theory for Knowledge Graph Embedding
Knowledge graph embedding has recently become a popular way to model relations and infer missing links. In this paper, we present a group theoretical perspective of knowledge graph embedding, connecting previous methods …
Graph EmbeddingKnowledge Graph EmbeddingLEMMAA Group-Theoretic Framework for Knowledge Graph Embedding
We have rigorously proved the existence of a group algebraic structure hidden in relational knowledge embedding problems, which suggests that a group-based embedding framework is essential for model design. Our theoretic…
Graph EmbeddingKnowledge Graph EmbeddingSpaceE: Knowledge Graph Embedding by Relational Linear Transformation in the Entity Space
Translation distance based knowledge graph embedding (KGE) methods, such as TransE and RotatE, model the relation in knowledge graphs as translation or rotation in the vector space. Both translation and rotation are inje…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsLink Prediction+2Abelian Neural Networks
We study the problem of modeling a binary operation that satisfies some algebraic requirements. We first construct a neural network architecture for Abelian group operations and derive a universal approximation property.…
Word EmbeddingsEquivariance by Contrast: Identifiable Equivariant Embeddings from Unlabeled Finite Group Actions
We propose Equivariance by Contrast (EbC) to learn equivariant embeddings from observation pairs $(\mathbf{y}, g \cdot \mathbf{y})$, where $g$ is drawn from a finite group acting on the data. Our method jointly learns a …