Adaptive Attentional Network for Few-Shot Knowledge Graph Completion (2020.emnlp-main)
Copied to clipboard
| Challenge: | Recent attempts to learn static representations of entities and references ignore their dynamic properties. |
| Approach: | They propose to learn static representations of entities and references ignoring their dynamic properties . a neighbor encoder learns entities' roles while a query-aware aggregator learns references' contributions . |
| Outcome: | The proposed approach achieves state-of-the-art results with different few-shot sizes. |
Similar Papers
Few-shot Low-resource Knowledge Graph Completion with Reinforced Task Generation (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing few-shot learning-based models have difficulty alleviating the long-tail issue on low-resource KGs because of the lack of training tasks. |
| Approach: | They propose a few-shot low-resource knowledge graph completion framework that generates and selects beneficial few- shot tasks that complement current tasks. |
| Outcome: | The proposed framework is based on several real-world knowledge graphs and validates on multiple domains. |
Learning Inter-Entity-Interaction for Few-Shot Knowledge Graph Completion (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent FKGC studies focus on learning semantic representations of entity pairs by separately encoding the neighborhoods of head and tail entities. |
| Approach: | They propose a model to learn semantic representations of entity pairs by separately encoding the neighborhoods of head and tail entities. |
| Outcome: | The proposed model outperforms state-of-the-art methods on two public datasets. |
Data Augmentation for Few-Shot Knowledge Graph Completion from Hierarchical Perspective (2022.coling-1)
Copied to clipboard
| Challenge: | Existing knowledge graph completion models require only a few associative triples to complete a relationship. |
| Approach: | They propose to perform data augmentation from two perspectives to solve the FKGC problem by inferring new triple facts from existing models. |
| Outcome: | The proposed framework can be applied to a number of existing models. |
A2N: Attending to Neighbors for Knowledge Graph Inference (P19-1)
Copied to clipboard
| Challenge: | Existing knowledge graph completion methods learn a fixed embedding for every entity, which is suboptimal as it requires memorizing and generalizing to all possible entity relationships. |
| Approach: | They propose a method which learns query-dependent representations of entities by combining relevant neighborhood of an entity. |
| Outcome: | The proposed model performs competitively or better than existing state-of-the-art models for knowledge graph completion. |
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. |
P-INT: A Path-based Interaction Model for Few-shot Knowledge Graph Completion (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to encode and match entity pairs have only a few observed reference entity pairs. |
| Approach: | They propose a model that infers and leverages paths that can expressively encode the relation of two entities. |
| Outcome: | The proposed model outperforms the state-of-the-art models by 11.2– 14.2% in terms of Hits@1. |
Few-shot Knowledge Graph Relational Reasoning via Subgraph Adaptation (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing methods to predict unseen triplets from knowledge graphs are limited by spurious information in KGs. |
| Approach: | They propose a framework that adapts contextualized graphs to subgraphs generated from support and query triplets to perform the prediction. |
| Outcome: | The proposed framework extracts more comprehensive information from support triplets while minimizing spurious information when predicting query triplet. |
Meta Relational Learning for Few-Shot Link Prediction in Knowledge Graphs (D19-1)
Copied to clipboard
| Challenge: | Empirically, our model achieves state-of-the-art results on few-shot link prediction KG benchmarks. |
| Approach: | They propose a Meta Relational Learning framework to do few-shot link prediction in KGs by observing only a few associative triples. |
| Outcome: | The proposed model achieves state-of-the-art results on few-shot link prediction KG benchmarks. |
Double-Branch Multi-Attention based Graph Neural Network for Knowledge Graph Completion (2023.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods cannot capture local and global information and are not designed well to learn representations of seen entities with sparse neighborhoods in isolated subgraphs. |
| Approach: | They propose a double-branch multi-attention based graph neural network to learn more expressive entity representations which contain rich global-local structural information. |
| Outcome: | The proposed method outperforms a general GNN-based approach for KGC. |
Few-shot Named Entity Recognition with Self-describing Networks (2022.acl-long)
Copied to clipboard
| Challenge: | Existing few-shot named entity recognition (NER) models capture information from limited instances while transferring useful knowledge from external resources. |
| Approach: | They propose a self-describing mechanism for few-shot NER which can universally describe mentions using concepts and automatically map novel entity types to concepts. |
| Outcome: | The proposed model can universally describe mentions using concepts and automatically map novel entity types to concepts and adaptively recognize entities on-demand. |