ExpressivE: A Spatio-Functional Embedding For Knowledge Graph Completion
- URL: http://arxiv.org/abs/2206.04192v2
- Date: Wed, 22 Mar 2023 11:20:01 GMT
- Title: ExpressivE: A Spatio-Functional Embedding For Knowledge Graph Completion
- Authors: Aleksandar Pavlovi\'c and Emanuel Sallinger
- Abstract summary: ExpressivE embeds pairs of entities as points and relations as hyper-parallelograms in the virtual triple space.
We show that ExpressivE is competitive with state-of-the-art KGEs and even significantly outperforms them on W18RR.
- Score: 78.8942067357231
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Knowledge graphs are inherently incomplete. Therefore substantial research
has been directed toward knowledge graph completion (KGC), i.e., predicting
missing triples from the information represented in the knowledge graph (KG).
KG embedding models (KGEs) have yielded promising results for KGC, yet any
current KGE is incapable of: (1) fully capturing vital inference patterns
(e.g., composition), (2) capturing prominent patterns jointly (e.g., hierarchy
and composition), and (3) providing an intuitive interpretation of captured
patterns. In this work, we propose ExpressivE, a fully expressive
spatio-functional KGE that solves all these challenges simultaneously.
ExpressivE embeds pairs of entities as points and relations as
hyper-parallelograms in the virtual triple space $\mathbb{R}^{2d}$. This model
design allows ExpressivE not only to capture a rich set of inference patterns
jointly but additionally to display any supported inference pattern through the
spatial relation of hyper-parallelograms, offering an intuitive and consistent
geometric interpretation of ExpressivE embeddings and their captured patterns.
Experimental results on standard KGC benchmarks reveal that ExpressivE is
competitive with state-of-the-art KGEs and even significantly outperforms them
on WN18RR.
Related papers
- Beyond Entity Alignment: Towards Complete Knowledge Graph Alignment via Entity-Relation Synergy [14.459419325027612]
Knowledge Graph alignment aims to integrate knowledge from multiple sources to address the limitations of individual Knowledge Graphs.
Existing models primarily emphasize the linkage of cross-graph entities but overlook aligning relations across KGs.
We propose a novel Expectation-Maximization-based model, EREM, which iteratively optimize both sub-tasks.
arXiv Detail & Related papers (2024-07-25T03:40:09Z) - EntailE: Introducing Textual Entailment in Commonsense Knowledge Graph
Completion [54.12709176438264]
Commonsense knowledge graphs (CSKGs) utilize free-form text to represent named entities, short phrases, and events as their nodes.
Current methods leverage semantic similarities to increase the graph density, but the semantic plausibility of the nodes and their relations are under-explored.
We propose to adopt textual entailment to find implicit entailment relations between CSKG nodes, to effectively densify the subgraph connecting nodes within the same conceptual class.
arXiv Detail & Related papers (2024-02-15T02:27:23Z) - A Comprehensive Study on Knowledge Graph Embedding over Relational
Patterns Based on Rule Learning [49.09125100268454]
Knowledge Graph Embedding (KGE) has proven to be an effective approach to solving the Knowledge Completion Graph (KGC) task.
Relational patterns are an important factor in the performance of KGE models.
We introduce a training-free method to enhance KGE models' performance over various relational patterns.
arXiv Detail & Related papers (2023-08-15T17:30:57Z) - CausE: Towards Causal Knowledge Graph Embedding [13.016173217017597]
Knowledge graph embedding (KGE) focuses on representing the entities and relations of a knowledge graph (KG) into the continuous vector spaces.
We build the new paradigm of KGE in the context of causality and embedding disentanglement.
We propose a Causality-enhanced knowledge graph Embedding (CausE) framework.
arXiv Detail & Related papers (2023-07-21T14:25:39Z) - Geometry Interaction Knowledge Graph Embeddings [153.69745042757066]
We propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces.
Our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities.
arXiv Detail & Related papers (2022-06-24T08:33:43Z) - Hyperbolic Hierarchical Knowledge Graph Embeddings for Link Prediction
in Low Dimensions [11.260501547769636]
We propose a novel KGE model called $textbfHyp$erbolic $textbfH$ierarchical $textbfKGE$ (HypHKGE)
This model introduces attention-based learnable curvatures for hyperbolic space, which helps preserve rich semantic hierarchies.
Experiments demonstrate the effectiveness of the proposed HypHKGE model on the three benchmark datasets.
arXiv Detail & Related papers (2022-04-28T03:41:41Z) - Structure-Augmented Text Representation Learning for Efficient Knowledge
Graph Completion [53.31911669146451]
Human-curated knowledge graphs provide critical supportive information to various natural language processing tasks.
These graphs are usually incomplete, urging auto-completion of them.
graph embedding approaches, e.g., TransE, learn structured knowledge via representing graph elements into dense embeddings.
textual encoding approaches, e.g., KG-BERT, resort to graph triple's text and triple-level contextualized representations.
arXiv Detail & Related papers (2020-04-30T13:50:34Z) - Embedding Graph Auto-Encoder for Graph Clustering [90.8576971748142]
Graph auto-encoder (GAE) models are based on semi-supervised graph convolution networks (GCN)
We design a specific GAE-based model for graph clustering to be consistent with the theory, namely Embedding Graph Auto-Encoder (EGAE)
EGAE consists of one encoder and dual decoders.
arXiv Detail & Related papers (2020-02-20T09:53:28Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.