Knowledge Graph Embedding with Atrous Convolution and Residual Learning (2020.coling-main)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods are complex and require time for training and inference. |
| Approach: | They propose an atrous convolution based knowledge graph embedding method that increases feature interactions by using atrous . they evaluate method on six benchmark datasets with different evaluation metrics . |
| Outcome: | The proposed method achieves better results on six benchmark datasets than state-of-the-art methods on most evaluation metrics. |
Similar Papers
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. |
Learning beyond Datasets: Knowledge Graph Augmented Neural Networks for Natural Language Processing (N18-1)
Copied to clipboard
| Challenge: | Currently, machine learning is limited in scalability and is limited to specific training data. |
| Approach: | They propose to enhance learning models with world knowledge in the form of Knowledge Graph fact triples for natural language processing tasks. |
| Outcome: | The proposed method is highly scalable to the amount of prior information that has to be processed and can be applied to any generic NLP task. |
Edge: Enriching Knowledge Graph Embeddings with External Text (2021.naacl-main)
Copied to clipboard
| Challenge: | Knowledge graphs suffer from sparsity which degrades the quality of representations generated by various methods. |
| Approach: | They propose a knowledge graph enrichment framework called Edge to enhance knowledge graphs based on "hard" co-occurrence of words in knowledge graph entities and external text. |
| Outcome: | The proposed framework achieves "soft" augmentation by combining external text with knowledge graph entities. |
Empowering Small-Scale Knowledge Graphs: A Strategy of Leveraging General-Purpose Knowledge Graphs for Enriched Embeddings (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing approaches to augment LLMs with Knowledge Graphs (KGs) Knowledge-intensive tasks are prone to errors and require a large amount of knowledge to be understood. |
| Approach: | They propose a framework for augmenting LLMs through Knowledge Graphs (KGs) they propose KGs can be used to enhance performance in knowledge-intensive tasks . |
| Outcome: | Experimental results show that a small domain-specific KG can benefit from a performance boost in downstream tasks when linked to a substantial general-purpose KG. |
Knowledge Graph Embedding Compression (2020.acl-main)
Copied to clipboard
| Challenge: | Knowledge graph (KG) embedding techniques that learn continuous embedds of entities and relations consume a large amount of storage and memory. |
| Approach: | They propose a method that compresses the KG embedding layer by representing each entity in the KA as a vector of discrete codes and then composes the embeddables from these codes. |
| Outcome: | The proposed approach achieves 50-1000x compression of embeddings with a minor loss in performance on standard KG embeddable evaluations and retains the ability to perform reasoning tasks such as KG inference. |
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. |
Efficient and Robust Knowledge Graph Construction (2022.aacl-tutorials)
Copied to clipboard
| Challenge: | Knowledge graph construction has appealed to the NLP community but has encountered similar issues such as efficiency and robustness. |
| Approach: | They propose to introduce efficient and robust knowledge graph construction techniques and discuss their results. |
| Outcome: | This tutorial will provide an overview of the latest and ongoing techniques for efficient and robust knowledge graph construction. |
A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network (N18-2)
Copied to clipboard
| Challenge: | Existing knowledge base embedding models are incomplete, i.e., missing a lot of valid triples. |
| Approach: | They propose a convolutional neural network embedding model for knowledge base completion that captures global relationships and transitional characteristics. |
| Outcome: | The proposed model outperforms state-of-the-art models on two benchmark datasets. |
Embedding Imputation with Grounded Language Information (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to embedding imputation use vector space properties or subword information to learn representations for rare or unseen words. |
| Approach: | They propose an online method to construct a knowledge graph from grounded information and an algorithm to map from the resulting graph to the space of the pre-trained embeddings. |
| Outcome: | The proposed method improves on a card-660 task by 11% and 17.8% respectively using GloVe embeddings. |
Pretrained Knowledge Base Embeddings for improved Sentential Relation Extraction (2022.acl-srw)
Copied to clipboard
| Challenge: | Existing models that perform explicit on-task training of graph embeddings are inadequate. |
| Approach: | They propose to combine pretrained knowledge base graph embeddings with transformer based language models to improve performance on sentential Relation Extraction task. |
| Outcome: | The proposed model outperforms state-of-the-art models on the sentential Relation Extraction task. |