English

NagE: Non-Abelian Group Embedding for Knowledge Graphs

Artificial Intelligence 2020-09-04 v3 Machine Learning Group Theory

Abstract

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.

Keywords

Cite

@article{arxiv.2005.10956,
  title  = {NagE: Non-Abelian Group Embedding for Knowledge Graphs},
  author = {Tong Yang and Long Sha and Pengyu Hong},
  journal= {arXiv preprint arXiv:2005.10956},
  year   = {2020}
}

Comments

work accepted the 29th ACM International Conference on Information and Knowledge Management

R2 v1 2026-06-23T15:43:48.715Z