Abstract
While Knowledge Graphs (KGs) have been applied in many AI tasks, KGs are known for being incomplete with many missing facts. Previous works rely on a large number of training data for KG completion. However, there are often few entity pairs available for most relations in KGs. In this paper, we propose a Few-shot Knowledge Graph Completion (FKGC) model, named Private and Shared feature extractors based on Hierarchical neighbor encoder for Adaptive few-shot knowledge graph completion (PSHA). In the PSHA model, we first exploit the hierarchical attention mechanism to extract the inherent and valuable hidden information of the neighborhood surrounding the entity. Following that, we adopt a private feature extractor to extract the private features of relation information of the entity pairs, and then a shared feature extractor is used to extract the shared features of the entity pairs of the support set. In addition, an adaptive aggregator aggregates entity pairs of the support set about the query. We conduct experiments on the 2-shot and 5-shot of the NELL-One and CoDEx-S-One dataset. The experimental results show that the PSHA outperforms the existing FKGC models in both scenarios.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.