| Challenge: | Existing models for link prediction fail to capture relation compositions, resulting in lack of interpretability for reasoning on incomplete knowledge graph (KG). |
| Approach: | They propose a new model that learns knowledge graph embeddings that can capture relation compositions by nature and reduces the solution space drastically. |
| Outcome: | The proposed model outperforms existing models and is comparable to or better than deep learning models such as ConvE. |
Similar Papers
Knowledge Graph Embedding with Hierarchical Relation Structure (D18-1)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding models embed entities and relations into latent vectors without leveraging rich information from relation structure. |
| Approach: | They extend existing KGE models to learn knowledge representations by leveraging relation structure . authors say their approach is capable of extending other KGEs . |
| Outcome: | The proposed approach can extend existing KGE models, and validates against baselines. |
Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs (P19-1)
Copied to clipboard
| Challenge: | Existing knowledge graphs (KGs) are incomplete or partial information, in the form of missing relations between entities, which gives rise to the task of knowledge base completion (also known as relation prediction). |
| Approach: | They propose to capture both entity and relation features in any given neighborhood and encapsulate relation clusters and multi-hop relations in their attention-based model. |
| Outcome: | The proposed model captures both entity and relation features in any given neighborhood and also encapsulates relation clusters and multi-hop relations. |
PairRE: Knowledge Graph Embeddings via Paired Relation Vectors (2021.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods fail to solve two major problems at the same time, leading to unsatisfactory results. |
| Approach: | They propose a model with paired vectors for each relation representation that can be adaptively adjusted to fit for different complex relations. |
| Outcome: | Experiments on two knowledge graph datasets show the proposed model can handle complex relations and encode relation patterns. |
MQuinE: a Cure for “Z-paradox” in Knowledge Graph Embedding (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding models suffer from Z-paradox, a deficiency in expressiveness . Embedding-based models map each entity and relation into a vector or matrix . |
| Approach: | They propose a new knowledge graph embedding model that does not suffer from Z-paradox while preserves strong expressiveness to model various relation patterns with theoretical justification. |
| Outcome: | The proposed model outperforms existing models on link prediction tasks while maintaining strong expressiveness. |
Learning Hierarchy-Aware Quaternion Knowledge Graph Embeddings with Representing Relations as 3D Rotations (2022.coling-1)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding models fail to model semantic hierarchies . Existing methods fail to understand the semantic hierarchies of knowledge graphs . |
| Approach: | They propose a model which embeds entities as pure quaternions and constrains the modulus of entities to make them have hierarchical distributions. |
| Outcome: | The proposed model can encode symmetry/antisymmetry, inversion, composition, multiple relation patterns and learn semantic hierarchies simultaneously. |
Low-Dimensional Hyperbolic Knowledge Graph Embeddings (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for predicting missing facts do not account for hierarchical and logical patterns in KGs. |
| Approach: | They propose a class of hyperbolic KG embedding models that capture hierarchical and logical patterns. |
| Outcome: | Experimental results show that the proposed method improves by 6.1% in mean reciprocal rank in low dimensions over previous methods. |
Poisoning Knowledge Graph Embeddings via Relation Inference Patterns (2021.acl-long)
Copied to clipboard
| Challenge: | Knowledge graph embeddings (KGE) models are increasingly deployed in domains with high stake decision making where it is critical to identify the potential security vulnerabilities that might cause failure. |
| Approach: | They propose to exploit the inductive abilities of knowledge graph embedding models by crafting adversarial additions that can improve model’s confidence on decoy facts. |
| Outcome: | The proposed attacks outperform state-of-the-art baselines on four KGE models for two publicly available datasets and generalize across all model-dataset combinations. |
Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding (2020.acl-main)
Copied to clipboard
| Challenge: | Existing knowledge graph embeddings have improved the knowledge graph link prediction task, but complex relations such as N-to-1, 1-to-N and N- to-N remain challenging to predict. |
| Approach: | They propose to extend RotatE from 2D complex domain to high dimensional space with orthogonal transforms to model relations. |
| Outcome: | The proposed method improves on N-to-1, 1-to-N and N- to-N cases while maintaining the capability for modeling symmetric/anti-symmetric, inverse and compositional relations. |
Hyperbolic Hierarchy-Aware Knowledge Graph Embedding for Link Prediction (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods are built on Euclidean space, which are difficult to handle hierarchical structures. |
| Approach: | They propose a KGE model with extended Poincaré Ball and polar coordinate system to capture hierarchical structures. |
| Outcome: | The proposed model captures hierarchical relationships with extended Poincaré Ball and polar coordinate system in hyperbolic space and achieves state-of-the-art results on part of link prediction tasks. |
Relation-aware Ensemble Learning for Knowledge Graph Embedding (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to explore semantics of knowledge graphs have been proposed to explore these semantics in distinct ways. |
| Approach: | They propose to leverage existing methods in relation-aware manner to learn an ensemble by leveraging existing methods. |
| Outcome: | The proposed method has the same computation cost as general ensemble methods but with much better performance on benchmark datasets. |