Mixup for Node and Graph Classification
Mixup is an advanced data augmentation method for training neural network based image classifiers, which interpolates both features and labels of a pair of images to produce synthetic samples. However, devising the Mixup methods for graph learning is challenging due to the irregularity and connectivity of graph data. In this work, we propose the Mixup methods for two fundamental tasks in graph learning: node and graph classification. To interpolate the irregular graph topology, we propose the two-branch graph convolution to mix the receptive field subgraphs for the paired nodes. Mixup on different node pairs can interfere with the mixed features for each other due to the connectivity between nodes. To block this interference, we propose the two-stage Mixup framework, which uses each node's neighbors' representations before Mixup for graph convolutions. For graph classification, we interpolate complex and diverse graphs in the semantic space. Qualitatively, our Mixup methods enable GNNs to learn more discriminative features and reduce over-fitting. Quantitative results show that our method yields consistent gains in terms of test accuracy and F1-micro scores on standard datasets, for both node and graph classification. Overall, our method effectively regularizes popular graph neural networks for better generalization without increasing their time complexity.
Code (1)
Tasks
ClassificationData AugmentationGraph ClassificationGraph LearningNode ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
S-Mixup: Structural Mixup for Graph Neural Networks
Existing studies for applying the mixup technique on graphs mainly focus on graph classification tasks, while the research in node classification is still under-explored. In this paper, we propose a novel mixup augmentat…
ClassificationGraph ClassificationGraph Neural NetworkNode ClassificationAGMixup: Adaptive Graph Mixup for Semi-supervised Node Classification
Mixup is a data augmentation technique that enhances model generalization by interpolating between data points using a mixing ratio $\lambda$ in the image domain. Recently, the concept of mixup has been adapted to the gr…
Data AugmentationNode ClassificationGraphMixup: Improving Class-Imbalanced Node Classification on Graphs by Self-supervised Context Prediction
Recent years have witnessed great success in handling node classification tasks with Graph Neural Networks (GNNs). However, most existing GNNs are based on the assumption that node samples for different classes are balan…
Node ClassificationGraph Mixup with Soft Alignments
We study graph data augmentation by mixup, which has been used successfully on images. A key operation of mixup is to compute a convex combination of a pair of inputs. This operation is straightforward for grid-like data…
Data AugmentationGraph ClassificationNodeMixup: Tackling Under-Reaching for Graph Neural Networks
Graph Neural Networks (GNNs) have become mainstream methods for solving the semi-supervised node classification problem. However, due to the uneven location distribution of labeled nodes in the graph, labeled nodes are o…
Node Classification