GraphCS: Community-Enhanced Minority Hard Point Generation Method
In graph classification tasks, the issue of class imbalance may lead models to be biased toward dominant classes, thereby reducing the recognition ability for minority classes and negatively impacting overall performance. To address this issue, this study proposes a community-enhanced minority hard point generation method. The method identifies "hard point" nodes in minority classes based on community strength, expanding the decision boundary to tackle the problem of spatial compression. Furthermore, graph diffusion smoothing is utilized to convert unweighted graphs into weighted ones, preserving the neighborhood structure's integrity. A differential graph diffusion strategy is adopted to generate the diffusion matrix. Experimental results demonstrate that this method significantly enhances the classification accuracy of Graph Neural Networks (GNNs) for minority class nodes on datasets such as Cora and Amazon-Photo, showcasing its effectiveness in solving class imbalance problems.
Authors
- Hanwen Qu
- Zhipeng Yan (ORCID: https://orcid.org/0000-0001-9623-2401)
- Enguang Zuo
- Yunpeng Wang (ORCID: https://orcid.org/0000-0003-4164-9677)
Institutions
- Xinjiang Uygur Autonomous Region Institute of Metrology and Measurement (CN)
- Xinjiang University (CN)
Publication Details
- Published
- 2024-12-06
- DOI
- https://doi.org/10.1109/cnteie66268.2024.00023
- Primary Topic
- Bioinformatics and Genomic Networks
- Type
- article
- Field-Weighted Citation Impact
- 0.00