TransNet: Transfer Knowledge for Few-shot Knowledge Graph Completion

• URL: http://arxiv.org/abs/2504.03720v1
• Date: Sat, 29 Mar 2025 23:39:11 GMT
• Title: TransNet: Transfer Knowledge for Few-shot Knowledge Graph Completion
• Authors: Lihui Liu, Zihao Wang, Dawei Zhou, Ruijie Wang, Yuchen Yan, Bo Xiong, Sihong He, Kai Shu, Hanghang Tong,
• Abstract summary: We propose a transfer learning-based few-shot KG completion method (TransNet)<n>By learning the relationships between different tasks, TransNet effectively transfers knowledge from similar tasks to improve the current task's performance.
• Score: 69.6049217133483
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Knowledge graphs (KGs) are ubiquitous and widely used in various applications. However, most real-world knowledge graphs are incomplete, which significantly degrades their performance on downstream tasks. Additionally, the relationships in real-world knowledge graphs often follow a long-tail distribution, meaning that most relations are represented by only a few training triplets. To address these challenges, few-shot learning has been introduced. Few-shot KG completion aims to make accurate predictions for triplets involving novel relations when only a limited number of training triplets are available. Although many methods have been proposed, they typically learn each relation individually, overlooking the correlations between different tasks and the relevant information in previously trained tasks. In this paper, we propose a transfer learning-based few-shot KG completion method (TransNet). By learning the relationships between different tasks, TransNet effectively transfers knowledge from similar tasks to improve the current task's performance. Furthermore, by employing meta-learning, TransNet can generalize effectively to new, unseen relations. Extensive experiments on benchmark datasets demonstrate the superiority of TransNet over state-of-the-art methods. Code can be found at https://github.com/lihuiliullh/TransNet/tree/main

Related papers

• Many or Few Samples? Comparing Transfer, Contrastive and Meta-Learning in Encrypted Traffic Classification [68.19713459228369]
  We compare transfer learning, meta-learning and contrastive learning against reference Machine Learning (ML) tree-based and monolithic DL models. We show that (i) using large datasets we can obtain more general representations, (ii) contrastive learning is the best methodology. While ML tree-based cannot handle large tasks but fits well small tasks, by means of reusing learned representations, DL methods are reaching tree-based models performance also for small tasks.
  arXiv  Detail & Related papers  (2023-05-21T11:20:49Z)
• Normalizing Flow-based Neural Process for Few-Shot Knowledge Graph Completion [69.55700751102376]
  Few-shot knowledge graph completion (FKGC) aims to predict missing facts for unseen relations with few-shot associated facts. Existing FKGC methods are based on metric learning or meta-learning, which often suffer from the out-of-distribution and overfitting problems. In this paper, we propose a normalizing flow-based neural process for few-shot knowledge graph completion (NP-FKGC)
  arXiv  Detail & Related papers  (2023-04-17T11:42:28Z)
• Knowledge Graph Refinement based on Triplet BERT-Networks [0.0]
  This paper adopts a transformer-based triplet network creating an embedding space that clusters the information about an entity or relation in the Knowledge Graph. It creates textual sequences from facts and fine-tunes a triplet network of pre-trained transformer-based language models. We show that GilBERT achieves better or comparable results to the state-of-the-art performance on these two refinement tasks.
  arXiv  Detail & Related papers  (2022-11-18T19:01:21Z)
• Hierarchical Relational Learning for Few-Shot Knowledge Graph Completion [25.905974480733562]
  We propose a hierarchical relational learning method (HiRe) for few-shot KG completion. By jointly capturing three levels of relational information, HiRe can effectively learn and refine the meta representation of few-shot relations. Experiments on two benchmark datasets validate the superiority of HiRe against other state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-09-02T17:57:03Z)
• From Discrimination to Generation: Knowledge Graph Completion with Generative Transformer [41.69537736842654]
  We provide an approach GenKGC, which converts knowledge graph completion to sequence-to-sequence generation task with the pre-trained language model. We introduce relation-guided demonstration and entity-aware hierarchical decoding for better representation learning and fast inference. We also release a new large-scale Chinese knowledge graph dataset AliopenKG500 for research purpose.
  arXiv  Detail & Related papers  (2022-02-04T12:52:32Z)
• An Adversarial Transfer Network for Knowledge Representation Learning [11.013390624382257]
  We propose an adversarial embedding transfer network ATransN, which transfers knowledge from one or more teacher knowledge graphs to a target one. Specifically, we add soft constraints on aligned entity pairs and neighbours to the existing knowledge representation learning methods.
  arXiv  Detail & Related papers  (2021-04-30T05:07:25Z)
• Graph-Based Neural Network Models with Multiple Self-Supervised Auxiliary Tasks [79.28094304325116]
  Graph Convolutional Networks are among the most promising approaches for capturing relationships among structured data points. We propose three novel self-supervised auxiliary tasks to train graph-based neural network models in a multi-task fashion.
  arXiv  Detail & Related papers  (2020-11-14T11:09:51Z)
• Knowledge-Guided Multi-Label Few-Shot Learning for General Image Recognition [75.44233392355711]
  KGGR framework exploits prior knowledge of statistical label correlations with deep neural networks. It first builds a structured knowledge graph to correlate different labels based on statistical label co-occurrence. Then, it introduces the label semantics to guide learning semantic-specific features. It exploits a graph propagation network to explore graph node interactions.
  arXiv  Detail & Related papers  (2020-09-20T15:05:29Z)
• Generative Adversarial Zero-Shot Relational Learning for Knowledge Graphs [96.73259297063619]
  We consider a novel formulation, zero-shot learning, to free this cumbersome curation. For newly-added relations, we attempt to learn their semantic features from their text descriptions. We leverage Generative Adrial Networks (GANs) to establish the connection between text and knowledge graph domain.
  arXiv  Detail & Related papers  (2020-01-08T01:19:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.