Bridging Source and Target Domains via Link Prediction for Unsupervised Domain Adaptation on Graphs

• URL: http://arxiv.org/abs/2505.24055v1
• Date: Thu, 29 May 2025 22:54:40 GMT
• Title: Bridging Source and Target Domains via Link Prediction for Unsupervised Domain Adaptation on Graphs
• Authors: Yilong Wang, Tianxiang Zhao, Zongyu Wu, Suhang Wang,
• Abstract summary: Graph neural networks (GNNs) have shown great ability for node classification on graphs.<n>Unsupervised domain adaptation (UDA) is attracting increasing attention.<n>We propose a novel framework that adopts link prediction to connect nodes between source and target graphs.
• Score: 26.856865172357168
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph neural networks (GNNs) have shown great ability for node classification on graphs. However, the success of GNNs relies on abundant labeled data, while obtaining high-quality labels is costly and challenging, especially for newly emerging domains. Hence, unsupervised domain adaptation (UDA), which trains a classifier on the labeled source graph and adapts it to the unlabeled target graph, is attracting increasing attention. Various approaches have been proposed to alleviate the distribution shift between the source and target graphs to facilitate the classifier adaptation. However, most of them simply adopt existing UDA techniques developed for independent and identically distributed data to gain domain-invariant node embeddings for graphs, which do not fully consider the graph structure and message-passing mechanism of GNNs during the adaptation and will fail when label distribution shift exists among domains. In this paper, we proposed a novel framework that adopts link prediction to connect nodes between source and target graphs, which can facilitate message-passing between the source and target graphs and augment the target nodes to have ``in-distribution'' neighborhoods with the source domain. This strategy modified the target graph on the input level to reduce its deviation from the source domain in the embedding space and is insensitive to disproportional label distributions across domains. To prevent the loss of discriminative information in the target graph, we further design a novel identity-preserving learning objective, which guides the learning of the edge insertion module together with reconstruction and adaptation losses. Experimental results on real-world datasets demonstrate the effectiveness of our framework.

Related papers

• Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesics [59.07903030446756]
  Graph neural networks are highly vulnerable to distribution shifts on graphs.<n>We present Gadget, the first framework for non-IID graph data.<n> Gadget can be seamlessly integrated with existing graph DA methods to handle large shifts on graphs.
  arXiv  Detail & Related papers  (2025-05-19T05:03:58Z)
• Bridging Domain Adaptation and Graph Neural Networks: A Tensor-Based Framework for Effective Label Propagation [23.79865440689265]
  Graph Neural Networks (GNNs) have recently become the predominant tools for studying graph data.<n>Despite state-of-the-art performance on graph classification tasks, GNNs are overwhelmingly trained in a single domain under supervision.<n>We propose the Label-Propagation Graph Neural Network (LP-TGNN) framework to bridge the gap between graph data and traditional domain adaptation methods.
  arXiv  Detail & Related papers  (2025-02-12T15:36:38Z)
• Towards Cross-domain Few-shot Graph Anomaly Detection [6.732699844225434]
  Cross-domain few-shot graph anomaly detection (GAD) is nontrivial owing to inherent data distribution discrepancies between the source and target domains. We propose a simple and effective framework, termed CDFS-GAD, specifically designed to tackle the aforementioned challenges.
  arXiv  Detail & Related papers  (2024-10-11T08:47:25Z)
• GraphLoRA: Structure-Aware Contrastive Low-Rank Adaptation for Cross-Graph Transfer Learning [17.85404473268992]
  Graph Neural Networks (GNNs) have demonstrated remarkable proficiency in handling a range of graph analytical tasks.<n>Despite their versatility, GNNs face significant challenges in transferability, limiting their utility in real-world applications.<n>We propose GraphLoRA, an effective and parameter-efficient method for transferring well-trained GNNs to diverse graph domains.
  arXiv  Detail & Related papers  (2024-09-25T06:57:42Z)
• Multi-source Unsupervised Domain Adaptation on Graphs with Transferability Modeling [35.39202826643388]
  We present the framework Selective Multi-source Adaptation for Graph (method), with a graph-modeling-based domain selector, a sub-graph node selector, and a bi-level alignment objective. Results on five graph datasets show the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2024-06-14T22:05:21Z)
• Semi-supervised Domain Adaptation in Graph Transfer Learning [24.32465362708831]
  Unsupervised domain adaptation on graphs aims for knowledge transfer from label-rich source graphs to unlabeled target graphs. This imposes critical challenges on graph transfer learning due to serious domain shifts and label scarcity. We propose a method named Semi-supervised Graph Domain Adaptation (SGDA) to address these challenges.
  arXiv  Detail & Related papers  (2023-09-19T17:20:58Z)
• Domain-adaptive Message Passing Graph Neural Network [67.35534058138387]
  Cross-network node classification (CNNC) aims to classify nodes in a label-deficient target network by transferring the knowledge from a source network with abundant labels. We propose a domain-adaptive message passing graph neural network (DM-GNN), which integrates graph neural network (GNN) with conditional adversarial domain adaptation.
  arXiv  Detail & Related papers  (2023-08-31T05:26:08Z)
• Zero-shot Domain Adaptation of Heterogeneous Graphs via Knowledge Transfer Networks [72.82524864001691]
  heterogeneous graph neural networks (HGNNs) have shown superior performance as powerful representation learning techniques. There is no direct way to learn using labels rooted at different node types. In this work, we propose a novel domain adaptation method, Knowledge Transfer Networks for HGNNs (HGNN-KTN)
  arXiv  Detail & Related papers  (2022-03-03T21:00:23Z)
• Handling Distribution Shifts on Graphs: An Invariance Perspective [78.31180235269035]
  We formulate the OOD problem on graphs and develop a new invariant learning approach, Explore-to-Extrapolate Risk Minimization (EERM) EERM resorts to multiple context explorers that are adversarially trained to maximize the variance of risks from multiple virtual environments. We prove the validity of our method by theoretically showing its guarantee of a valid OOD solution.
  arXiv  Detail & Related papers  (2022-02-05T02:31:01Z)
• Source Free Unsupervised Graph Domain Adaptation [60.901775859601685]
  Unsupervised Graph Domain Adaptation (UGDA) shows its practical value of reducing the labeling cost for node classification. Most existing UGDA methods heavily rely on the labeled graph in the source domain. In some real-world scenarios, the source graph is inaccessible because of privacy issues. We propose a novel scenario named Source Free Unsupervised Graph Domain Adaptation (SFUGDA)
  arXiv  Detail & Related papers  (2021-12-02T03:18:18Z)
• Discriminative Cross-Domain Feature Learning for Partial Domain Adaptation [70.45936509510528]
  Partial domain adaptation aims to adapt knowledge from a larger and more diverse source domain to a smaller target domain with less number of classes. Recent practice on domain adaptation manages to extract effective features by incorporating the pseudo labels for the target domain. It is essential to align target data with only a small set of source data.
  arXiv  Detail & Related papers  (2020-08-26T03:18:53Z)
• Supervised Domain Adaptation using Graph Embedding [86.3361797111839]
  Domain adaptation methods assume that distributions between the two domains are shifted and attempt to realign them. We propose a generic framework based on graph embedding. We show that the proposed approach leads to a powerful Domain Adaptation framework.
  arXiv  Detail & Related papers  (2020-03-09T12:25:13Z)

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.