NagE: Non-Abelian Group Embedding for Knowledge Graphs

17Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Yang, T., Sha, L., & Hong, P. (2020). NagE: Non-Abelian Group Embedding for Knowledge Graphs. In International Conference on Information and Knowledge Management, Proceedings (pp. 1735–1742). Association for Computing Machinery. https://doi.org/10.1145/3340531.3411875

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free