A Relational Memory-based Embedding Model for Triple Classification and Search Personalization (2020.acl-main)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods do not allow for the prediction of new triples, such as for search personalization tasks. |
| Approach: | They propose a relational memory network to encode potential dependencies in relationship triples by a transformer self-attention mechanism. |
| Outcome: | The proposed model obtains state-of-the-art results on SEARCH17, WN11 and FB13 for the search personalization task, and on a convolutional neural network-based decoder. |
Similar Papers
A Capsule Network-based Embedding Model for Knowledge Graph Completion and Search Personalization (N19-1)
Copied to clipboard
| Challenge: | Existing knowledge graphs with billions of triples are incomplete, i.e., missing a lot of valid triples. |
| Approach: | They propose to embed relationship triples into a capsule network using a convolution layer and multiple filters to generate feature maps. |
| Outcome: | The proposed model outperforms strong search personalization baselines on two benchmark datasets and outperformed previous state-of-the-art models on WN18RR and FB15k-237. |
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. |
Accurate Text-Enhanced Knowledge Graph Representation Learning (N18-1)
Copied to clipboard
| Challenge: | Existing representation learning methods for knowledge graph representation do not consider the ambiguity of relations and entities. |
| Approach: | They propose a text-enhanced knowledge graph representation learning method which exploits the entity descriptions and triple-specific relation mention to enhance representations. |
| Outcome: | The proposed method outperforms existing representation learning models on link prediction and triple classification tasks and significantly outperformed existing models. |
Bridging Text and Knowledge with Multi-Prototype Embedding for Few-Shot Relational Triple Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Existing approaches to supervised relational triple extraction require huge amounts of labeled data. |
| Approach: | They propose a multi-prototype embedding network model to extract the composition of relational triples from unstructured text. |
| Outcome: | The proposed method improves the performance of the few-shot relational triple extraction problem. |
Query-based Instance Discrimination Network for Relational Triple Extraction (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent approaches to extract relational triples from open domain texts suffer from error propagation, relation redundancy and lack of high-level connections. |
| Approach: | They propose a query-based approach to construct instance-level representations for relational triples . they use query embeddings and token embeddables to extract all types of triples in one step . |
| Outcome: | The proposed method achieves state-of-the-art on five widely used benchmarks. |
Does it Really Generalize Well on Unseen Data? Systematic Evaluation of Relational Triple Extraction Methods (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing extraction models memorize and recall already seen triples but cannot generalize effectively for unseen triples. |
| Approach: | They propose a method to generalize existing extraction models by rearranging datasets and augmenting test sets. |
| Outcome: | The proposed method can significantly increase the generalization performance of existing models. |
Entity or Relation Embeddings? An Analysis of Encoding Strategies for Relation Extraction (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to relation extraction use concatenating embeddings of head and tail entities . however, such representations capture the types of the entities involved, leading to false positives and confusion between relations involving entities of the same type. |
| Approach: | They propose a model which combines [MASK] embeddings with entity embedds to learn relation embeddations. |
| Outcome: | The proposed model outperforms the state-of-the-art on several benchmarks . it uses a self-supervised pre-training strategy which further improves the results. |
A Retrofitting Model for Incorporating Semantic Relations into Word Embeddings (2020.coling-main)
Copied to clipboard
| Challenge: | Existing word embedding models mix semantic similarity with other types of relatedness. |
| Approach: | They propose a model that leverages relational knowledge available in a knowledge resource to improve word embeddings. |
| Outcome: | The proposed model improves word embeddings on synonymy, antonymy and hypernymy relations in WordNet and significantly improves lexical entailment detection task. |
A Mutual Information Perspective on Knowledge Graph Embedding (2025.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding techniques suffer from high intra-group similarity, loss of semantic information, and insufficient inference capability, particularly in complex relation patterns such as 1-N and N-1 relations. |
| Approach: | They propose a knowledge graph embedding framework that leverages mutual information maximization to improve the semantic representation of entities and relations. |
| Outcome: | Extensive experiments on benchmark datasets demonstrate the effectiveness of the proposed method, with consistent performance improvements across various baseline models. |
A Novel Cascade Binary Tagging Framework for Relational Triple Extraction (2020.acl-main)
Copied to clipboard
| Challenge: | Existing approaches to extract relational triples from unstructured text are inadequate to solve the overlapping triple problem. |
| Approach: | They propose a cascade binary tagging framework that models relations as functions that map subjects to objects in a sentence. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on two datasets . it outperformed baseline methods by 17.5 and 30.2 absolute gains . |