DeepAI AI Chat
Log In Sign Up

A Non-commutative Bilinear Model for Answering Path Queries in Knowledge Graphs

by   Katsuhiko Hayashi, et al.
Nara Institute of Science and Technology
Osaka University

Bilinear diagonal models for knowledge graph embedding (KGE), such as DistMult and ComplEx, balance expressiveness and computational efficiency by representing relations as diagonal matrices. Although they perform well in predicting atomic relations, composite relations (relation paths) cannot be modeled naturally by the product of relation matrices, as the product of diagonal matrices is commutative and hence invariant with the order of relations. In this paper, we propose a new bilinear KGE model, called BlockHolE, based on block circulant matrices. In BlockHolE, relation matrices can be non-commutative, allowing composite relations to be modeled by matrix product. The model is parameterized in a way that covers a spectrum ranging from diagonal to full relation matrices. A fast computation technique is developed on the basis of the duality of the Fourier transform of circulant matrices.


DensE: An Enhanced Non-Abelian Group Representation for Knowledge Graph Embedding

Capturing the composition patterns of relations is a vital task in knowl...

Relation Embedding with Dihedral Group in Knowledge Graph

Link prediction is critical for the application of incomplete knowledge ...

Knowledge Graph Embedding with Multiple Relation Projections

Knowledge graphs contain rich relational structures of the world, and th...

Improved method for finding optimal formulae for bilinear maps in a finite field

In 2012, Barbulescu, Detrey, Estibals and Zimmermann proposed a new fram...

On matrices with displacement structure: generalized operators and faster algorithms

For matrices with displacement structure, basic operations like multipli...

Local congruence of chain complexes

The object of this paper is to transform a set of local chain complexes ...