Abstract:
Graph Meta-learning methods have improved the performance of few-shot node classification by means of applying meta-learning to the data in non-Euclidean domains. However...Show MoreMetadata
Abstract:
Graph Meta-learning methods have improved the performance of few-shot node classification by means of applying meta-learning to the data in non-Euclidean domains. However, most works focus on adopting a single domain, ignoring the fact that tasks in various domains may be distinct, which can cause overfitting problems and thus limit generalizability. To tackle this challenge, we propose a novel Graph Meta-learning framework called Feature-Enhanced Cross-domain Graph Meta-learning that consists of two crucial modules: 1) A feature information extraction module that aims to capture discriminative node importance and simulate various node feature distributions under distinct domains; 2) A heterogeneous graph encoder module that leverages the enhanced node features and topological information to generate task-specific node embeddings with simple fine-tuning. Moreover, we meta-learn the parameters involved to ensure the generalizability in the unseen domains. Results show that our method markedly outperforms the existing state-of-the-art methods.
Published in: ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Date of Conference: 06-11 April 2025
Date Added to IEEE Xplore: 07 March 2025
ISBN Information: