GraphSHA: Synthesizing Harder Samples for Class-Imbalanced Node Classification

• URL: http://arxiv.org/abs/2306.09612v1
• Date: Fri, 16 Jun 2023 04:05:58 GMT
• Title: GraphSHA: Synthesizing Harder Samples for Class-Imbalanced Node Classification
• Authors: Wen-Zhi Li, Chang-Dong Wang, Hui Xiong, Jian-Huang Lai
• Abstract summary: Class imbalance is the phenomenon that some classes have much fewer instances than others. Recent studies find that off-the-shelf Graph Neural Networks (GNNs) would under-represent minor class samples. We propose a general framework GraphSHA by Synthesizing HArder minor samples.
• Score: 64.85392028383164
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Class imbalance is the phenomenon that some classes have much fewer instances than others, which is ubiquitous in real-world graph-structured scenarios. Recent studies find that off-the-shelf Graph Neural Networks (GNNs) would under-represent minor class samples. We investigate this phenomenon and discover that the subspaces of minor classes being squeezed by those of the major ones in the latent space is the main cause of this failure. We are naturally inspired to enlarge the decision boundaries of minor classes and propose a general framework GraphSHA by Synthesizing HArder minor samples. Furthermore, to avoid the enlarged minor boundary violating the subspaces of neighbor classes, we also propose a module called SemiMixup to transmit enlarged boundary information to the interior of the minor classes while blocking information propagation from minor classes to neighbor classes. Empirically, GraphSHA shows its effectiveness in enlarging the decision boundaries of minor classes, as it outperforms various baseline methods in class-imbalanced node classification with different GNN backbone encoders over seven public benchmark datasets. Code is avilable at https://github.com/wenzhilics/GraphSHA.

Related papers

• Open-World Semi-Supervised Learning for Node Classification [53.07866559269709]
  Open-world semi-supervised learning (Open-world SSL) for node classification is a practical but under-explored problem in the graph community. We propose an IMbalance-Aware method named OpenIMA for Open-world semi-supervised node classification.
  arXiv  Detail & Related papers  (2024-03-18T05:12:54Z)
• BuffGraph: Enhancing Class-Imbalanced Node Classification via Buffer Nodes [41.81470712194631]
  Class imbalance in graph-structured data, where minor classes are significantly underrepresented, poses a critical challenge for Graph Neural Networks (GNNs) We introduce BuffGraph, which inserts buffer nodes into the graph, modulating the impact of majority classes to improve minor class representation. Our experiments across diverse real-world datasets empirically demonstrate that BuffGraph outperforms existing baseline methods in class-imbalanced node classification.
  arXiv  Detail & Related papers  (2024-02-20T16:11:59Z)
• Neural Collapse Inspired Feature-Classifier Alignment for Few-Shot Class Incremental Learning [120.53458753007851]
  Few-shot class-incremental learning (FSCIL) has been a challenging problem as only a few training samples are accessible for each novel class in the new sessions. We deal with this misalignment dilemma in FSCIL inspired by the recently discovered phenomenon named neural collapse. We propose a neural collapse inspired framework for FSCIL. Experiments on the miniImageNet, CUB-200, and CIFAR-100 datasets demonstrate that our proposed framework outperforms the state-of-the-art performances.
  arXiv  Detail & Related papers  (2023-02-06T18:39:40Z)
• Synthetic Over-sampling for Imbalanced Node Classification with Graph Neural Networks [34.81248024048974]
  Graph neural networks (GNNs) have achieved state-of-the-art performance for node classification. In many real-world scenarios, node classes are imbalanced, with some majority classes making up most parts of the graph. In this work, we seek to address this problem by generating pseudo instances of minority classes to balance the training data.
  arXiv  Detail & Related papers  (2022-06-10T19:47:05Z)
• Geometer: Graph Few-Shot Class-Incremental Learning via Prototype Representation [50.772432242082914]
  Existing graph neural network based methods mainly focus on classifying unlabeled nodes within fixed classes with abundant labeling. In this paper, we focus on this challenging but practical graph few-shot class-incremental learning (GFSCIL) problem and propose a novel method called Geometer. Instead of replacing and retraining the fully connected neural network classifer, Geometer predicts the label of a node by finding the nearest class prototype.
  arXiv  Detail & Related papers  (2022-05-27T13:02:07Z)
• Geometric Graph Representation Learning via Maximizing Rate Reduction [73.6044873825311]
  Learning node representations benefits various downstream tasks in graph analysis such as community detection and node classification. We propose Geometric Graph Representation Learning (G2R) to learn node representations in an unsupervised manner. G2R maps nodes in distinct groups into different subspaces, while each subspace is compact and different subspaces are dispersed.
  arXiv  Detail & Related papers  (2022-02-13T07:46:24Z)
• GraphMixup: Improving Class-Imbalanced Node Classification on Graphs by Self-supervised Context Prediction [25.679620842010422]
  This paper presents GraphMixup, a novel mixup-based framework for improving class-imbalanced node classification on graphs. We develop a emphReinforcement Mixup mechanism to adaptively determine how many samples are to be generated by mixup for those minority classes. Experiments on three real-world datasets show that GraphMixup yields truly encouraging results for class-imbalanced node classification tasks.
  arXiv  Detail & Related papers  (2021-06-21T14:12:16Z)
• Graph Classification by Mixture of Diverse Experts [67.33716357951235]
  We present GraphDIVE, a framework leveraging mixture of diverse experts for imbalanced graph classification. With a divide-and-conquer principle, GraphDIVE employs a gating network to partition an imbalanced graph dataset into several subsets. Experiments on real-world imbalanced graph datasets demonstrate the effectiveness of GraphDIVE.
  arXiv  Detail & Related papers  (2021-03-29T14:03:03Z)
• GraphSMOTE: Imbalanced Node Classification on Graphs with Graph Neural Networks [28.92347073786722]
  Graph neural networks (GNNs) have achieved state-of-the-art performance of node classification. We propose a novel framework, GraphSMOTE, in which an embedding space is constructed to encode the similarity among the nodes. New samples are synthesize in this space to assure genuineness.
  arXiv  Detail & Related papers  (2021-03-16T03:23:55Z)

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.