Pith. sign in

ECGN: A Cluster-Aware Approach to Graph Neural Networks for Imbalanced Classification

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Classifying nodes in a graph is a common problem. The ideal classifier must adapt to any imbalances in the class distribution. It must also use information in the clustering structure of real-world graphs. Existing Graph Neural Networks (GNNs) have not addressed both problems together. We propose the Enhanced Cluster-aware Graph Network (ECGN), a novel method that addresses these issues by integrating cluster-specific training with synthetic node generation. Unlike traditional GNNs that apply the same node update process for all nodes, ECGN learns different aggregations for different clusters. We also use the clusters to generate new minority-class nodes in a way that helps clarify the inter-class decision boundary. By combining cluster-aware embeddings with a global integration step, ECGN enhances the quality of the resulting node embeddings. Our method works with any underlying GNN and any cluster generation technique. Experimental results show that ECGN consistently outperforms its closest competitors by up to 11% on some widely studied benchmark datasets.

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Fast Clustering of Categorical Big Data

cs.LG · 2025-02-10 · conditional · novelty 3.0

Bisecting K-Modes initializes K-Modes clustering via hierarchical splitting and shows promising speed and quality on large categorical datasets, but the experimental validation is limited.

citing papers explorer

Showing 1 of 1 citing paper.

  • Fast Clustering of Categorical Big Data cs.LG · 2025-02-10 · conditional · none · ref 34 · internal anchor

    Bisecting K-Modes initializes K-Modes clustering via hierarchical splitting and shows promising speed and quality on large categorical datasets, but the experimental validation is limited.