High-Order Structure-Preserving Graph Neural Network for Few-Shot Learning

Few-shot learning can find the latent structure information between the support and query data by the similarity metric of meta-learning to construct the discriminative model for recognizing the new categories with the less labeled samples. Most existing methods attempt to model the similarity relationships among samples within meta-tasks for achieving this goal. However, the relationship assessment among samples from distinct meta-tasks is challenging due to the differing metric relationships inherent to each respective meta-task. To address this issue, high-order structure-preserving graph neural network (HOSP-GNN) can deeply explore the rich samples structure of the different meta-tasks to predict the label of the queried data based on the graph. HOSP-GNN can mine high-order structures to enhance their relevance by triple samples. In addition, it can also generate the updating rule of the different-order structures for node and edge representation optimization under manifold constraints. Notably, HOSP-GNN eliminates the need for retraining the learning model to recognize new classes, thanks to its high generalization of high-order structure that ensures model adaptability. The experiments demonstrate that HOSP-GNN outperforms state-of-the-art methods in four benchmark datasets, as well as on a self-built dataset focusing on endangered animals. The available code is <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/yangfeifei02/HOSP</uri>.