A Non-commutative Bilinear Model for Answering Path Queries in Knowledge Graphs
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Computational EfficiencyGraph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsRelationSimilar Papers 제목 키워드 기반
RotateCT: Knowledge Graph Embedding by Rotation and Coordinate Transformation in Complex Space
Knowledge graph embedding, which aims to learn representations of entities and relations in knowledge graphs, finds applications in various downstream tasks. The key to success of knowledge graph embedding models are the…
Computational EfficiencyGraph EmbeddingKnowledge Graph EmbeddingKnowledge Graphs+2Answering Regular Path Queries Over SQ Ontologies
We study query answering in the description logic $\mathcal{SQ}$ supporting qualified number restrictions on both transitive and non-transitive roles. Our main contributions are a tree-like model property for $\mathcal{S…
QubitE: Qubit Embedding for Knowledge Graph Completion
Knowledge graph embeddings (KGEs) learn low-dimensional representations of entities and relations to predict missing facts based on existing ones. Quantum-based KGEs utilise variational quantum circuits for link predict…
Complex Query AnsweringKnowledge Graph CompletionKnowledge Graph EmbeddingsKnowledge Graphs+1RConE: Rough Cone Embedding for Multi-Hop Logical Query Answering on Multi-Modal Knowledge Graphs
Multi-hop query answering over a Knowledge Graph (KG) involves traversing one or more hops from the start node to answer a query. Path-based and logic-based methods are state-of-the-art for multi-hop question answering. …
Knowledge GraphsLink PredictionMulti-hop Question AnsweringNegation+1iQUEST: An Iterative Question-Guided Framework for Knowledge Base Question Answering
While Large Language Models (LLMs) excel at many natural language processing tasks, they often suffer from factual inaccuracies in knowledge-intensive scenarios. Integrating external knowledge resources, particularly kno…
Graph Neural NetworkKnowledge Base Question AnsweringKnowledge GraphsQuestion Answering