Saved in:
| Main Authors: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.11765 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916440006721536 |
|---|---|
| author | Thapaliya, Bishal Nguyen, Anh Lu, Yao Xie, Tian Grudetskyi, Igor Lin, Fudong Valkanas, Antonios Liu, Jingyu Chakraborty, Deepayan Fehri, Bilel |
| author_facet | Thapaliya, Bishal Nguyen, Anh Lu, Yao Xie, Tian Grudetskyi, Igor Lin, Fudong Valkanas, Antonios Liu, Jingyu Chakraborty, Deepayan Fehri, Bilel |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_11765 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | ECGN: A Cluster-Aware Approach to Graph Neural Networks for Imbalanced Classification Thapaliya, Bishal Nguyen, Anh Lu, Yao Xie, Tian Grudetskyi, Igor Lin, Fudong Valkanas, Antonios Liu, Jingyu Chakraborty, Deepayan Fehri, Bilel Machine Learning 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. |
| title | ECGN: A Cluster-Aware Approach to Graph Neural Networks for Imbalanced Classification |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2410.11765 |