| Challenge: | Existing knowledge graph embedding methods encode concepts and instances as vectors in a low-dimensional space, ignoring the difference between concepts and instance. |
| Approach: | They propose a knowledge graph embedding model that separates concepts from instances by differentiating concepts and instances. |
| Outcome: | The proposed model outperforms state-of-the-art methods on link prediction and triple classification tasks on YAGO dataset. |
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. |
Improving Knowledge Graph Embedding Using Affine Transformations of Entities Corresponding to Each Relation (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods use k-dimensional vectors to represent each entity in a knowledge graph. |
| Approach: | They propose to use affine transformations to embed knowledge graphs using previous methods . they propose to add k additional variables to the existing methods to perform embedding . |
| Outcome: | The proposed method outperforms RotatE, Distmult and ComplEx on various data sets. |
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. |
TranS: Transition-based Knowledge Graph Embedding with Synthetic Relation Representation (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Knowledge graph embedding (KGE) is a computational approach to learn continuous vector representations of relations and entities in knowledge graphs. |
| Approach: | They propose a transition-based method to learn continuous vector representations of relations and entities in knowledge graph (KG) it replaces a single relation vector in the relation part with a synthetic relation representation with entity-relation interactions to solve these problems. |
| Outcome: | The proposed method achieves state-of-the-art on a large knowledge graph dataset. |
Knowledge Graph Alignment with Entity-Pair Embedding (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for Knowledge Graph (KG) alignment are not satisfactory. |
| Approach: | They propose a method that directly learns embeddings of entity-pairs for KG alignment. |
| Outcome: | The proposed approach can achieve state-of-the-art on five real-world datasets. |
Towards Understanding the Geometry of Knowledge Graph Embeddings (P18-1)
Copied to clipboard
| Challenge: | Knowledge Graph (KG) embedding has emerged as a very active area of research over the last few years, resulting in the development of several embeddable methods. |
| Approach: | They propose to use KG embedding methods to represent entities and relations as vectors in a high-dimensional space. |
| Outcome: | The proposed methods represent entities and relations in KGs as vectors in a high-dimensional space. |
SEEK: Segmented Embedding of Knowledge Graphs (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph embedding can not make a proper trade-off between the model complexity and the model expressiveness, which makes them far from satisfactory. |
| Approach: | They propose a lightweight modeling framework that can achieve highly competitive relational expressiveness without increasing the model complexity. |
| Outcome: | The proposed framework can achieve highly competitive relational expressiveness without increasing model complexity. |
OntoEA: Ontology-guided Entity Alignment via Joint Knowledge Graph Embedding (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for aligning knowledge graph entities ignore the ontology which contains critical meta information such as classes and membership relationships with entities. |
| Approach: | They propose an ontology-guided method where KGs and ontologies are jointly embedded. |
| Outcome: | Extensive experiments on seven public and industrial benchmarks show the ontology-guided method performs well and is cost-effective. |
Semi-supervised Entity Alignment via Joint Knowledge Embedding Model and Cross-graph Model (D19-1)
Copied to clipboard
| Challenge: | Entity alignment aims at integrating complementary knowledge graphs (KGs) from different sources or languages. |
| Approach: | They propose a semi-supervised entity alignment method by joint Knowledge Embedding model and Cross-Graph model to make better use of seed alignments to propagate over the entire graphs with KG-based constraints. |
| Outcome: | The proposed method can make better use of seed alignments to propagate over entire graphs with KG-based constraints. |
AutoETER: Automated Entity Type Representation for Knowledge Graph Embedding (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge graphs are incomplete whether they are constructed manually or automatically, limiting the effectiveness when exploited for downstream applications. |
| Approach: | They propose a KGE framework with an automatic type embedding mechanism which can be easily integrated into any existing KGE model. |
| Outcome: | The proposed model can model and infer all the relation patterns and complex relations compared to state-of-the-art models on four datasets. |