ORCID

Abstract

Abstract Even though numerous works focus on the few-shot learning issue by combining meta-learning, there are still limits to traditional graph classification problems. The antecedent algorithms directly extract features from the samples, and do not take into account the preference of the trained model to the previously “seen” targets. In order to overcome the aforementioned issues, an effective strategy with training an unbiased meta-learning algorithm was developed in this paper, which sorted out problems of target preference and few-shot under the meta-learning paradigm. First, the interactive attention extraction module as a supplement to feature extraction was employed, which improved the separability of feature vectors, reduced the preference of the model for a certain target, and remarkably improved the generalization ability of the model on the new task. Second, the graph neural network was used to fully mine the relationship between samples to constitute graph structures and complete image classification tasks at a node level, which greatly enhanced the accuracy of classification. A series of experimental studies were conducted to validate the proposed methodology, where the few-shot and semisupervised learning problem has been effectively solved. It also proved that our model has better accuracy than traditional classification methods on real-world datasets.

DOI

10.1093/jcde/qwab050

Publication Date

2021-09-15

Publication Title

Journal of Computational Design and Engineering

Volume

8

Issue

5

ISSN

2288-4300

Embargo Period

2021-09-18

Organisational Unit

School of Engineering, Computing and Mathematics

First Page

1355

Last Page

1366

Download

Share

COinS