When True Becomes False: Few-Shot Link Prediction beyond Binary Relations through Mining False Positive Entities
Xuan Zhang, Xun Liang, Xiangping Zheng, Bo Wu, Yuhui Guo
Abstract
Recently, the link prediction task on Hyper-relational Knowledge Graphs (HKGs) has been a hot spot, which aims to predict new facts beyond binary relations. Although previous models have accomplished considerable achievements, there remain three challenges: i) the previous models neglect the existence of False Positive Entities (FPEs), which are true entities in the binary triples, yet becomes false when encountering the query statements of HKGs; ii) Due to the sparse interactions, the models are not capable of coping with long-tail hyper-relations, which are ubiquitous in the real-world; iii) The models are generally transductive learning processes, and have difficulty in adapting new hyper-relations. To tackle the above issues, we firstly propose the task of few-shot link prediction on HKGs and devise hyper-relation-aware attention networks with a contrastive loss, which are empowered to encode all entities including FPEs effectively and increase the distance between the true entities and FPEs through contrastive learning. With few-shot references available, the proposed model then learns the representations of their long-tail hyper-relations and predicts new links by calculating the likelihood between queries and references. Furthermore, our model is inductive and can be scalable to any new hyper-relation effortlessly. Since it is the first trial on few-shot link prediction for HKGs, we also modify the existing few-shot learning approaches on binary relational data to work with HKGs as baselines. Experimental results on three real-world datasets show the superiority of our model over various state-of-the-art baselines.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get be3d6928-630b-417b-99d5-8a9ff794eb7aCited by top-tier papers1
Ask how each one uses itRelated papers
- Learning Inter-Entity-Interaction for Few-Shot Knowledge Graph CompletionYuling Li, Kui Yu, Xiaoling Huang, Yuhong ZhangEMNLP 2022 · 24 citations
- Few-Shot Knowledge Graph CompletionChuxu Zhang, Huaxiu Yao, Chao Huang, Meng Jiang et al.AAAI 2020 · 238 citations
- Adaptive Attentional Network for Few-Shot Knowledge Graph CompletionJiawei Sheng, Shu Guo, Zhenyu Chen, Juwei Yue et al.EMNLP 2020 · 117 citations
- Hierarchical Relational Learning for Few-Shot Knowledge Graph CompletionHan Wu, Jie Yin, Bala Rajaratnam, Jianyuan GuoICLR 2023 · 9 citations
- Few-shot Low-resource Knowledge Graph Completion with Multi-view Task Representation GenerationShichao Pei, Ziyi Kou, Qiannan Zhang, Xiangliang ZhangKDD 2023 · 9 citations
