paper-with-me

홈 › Papers

Graph Attention Specialized Expert Fusion Model for Node Classification: Based on Cora and Pubmed Datasets

2025-07-21 · Zihang Ma, Qitian Yin arxiv

Graph node classification is a fundamental task in graph neural networks (GNNs), aiming to assign predefined class labels to nodes. On the PubMed citation network dataset, we observe significant classification difficulty disparities, with Category 2 achieving only 74.4% accuracy in traditional GCN, 7.5% lower than Category 1. To address this, we propose a Wasserstein-Rubinstein (WR) distance enhanced Expert Fusion Model (WR-EFM), training specialized GNN models for Categories 0/1 (with layer normalization and residual connections) and Multi-hop Graph Attention Networks (GAT) for Category 2. The WR distance metric optimizes representation similarity between models, particularly focusing on improving Category 2 performance. Our adaptive fusion strategy dynamically weights models based on category-specific performance, with Category 2 assigned a GAT weight of 0.8. WR distance further guides the fusion process by measuring distributional differences between model representations, enabling more principled integration of complementary features. Experimental results show WR-EFM achieves balanced accuracy across categories: 77.8% (Category 0), 78.0% (Category 1), and 79.9% (Category 2), outperforming both single models and standard fusion approaches. The coefficient of variation (CV) of WR-EFM's category accuracies is 0.013, 77.6% lower than GCN's 0.058, demonstrating superior stability. Notably, WR-EFM improves Category 2 accuracy by 5.5% compared to GCN, verifying the effectiveness of WR-guided fusion in capturing complex structural patterns. This work provides a novel paradigm for handling class-imbalanced graph classification tasks. To promote the research community, we release our project at https://github.com/s010m00n/GASEM4NC.

📄 PDF Abstract BibTeX arXiv:2507.15784

Code (0)

등록된 구현이 없습니다.

Tasks

Graph ClassificationNode Classification

Results from the Paper

RankTaskDatasetModelMetrics
#3 Graph Classification Pubmed Wasserstein-Rubinstein Test Accuracy: 74.4
#64 Node Classification Pubmed Wasserstein-Rubinstein Accuracy: 74.4

Similar Papers 제목 키워드 기반

DiffGraph: An Automated Agent-driven Model Merging Framework for In-the-Wild Text-to-Image Generation

2026-03-20 · Zhuoling Li, Hossein Rahmani, Jiarui Zhang, Yu Xue 외 arxiv

The rapid growth of the text-to-image (T2I) community has fostered a thriving online ecosystem of expert models, which are variants of pretrained diffusion models specialized for diverse generative abilities. Yet, existi…

Text-to-Image Generation

NCSTR: Node-Centric Decoupled Spatio-Temporal Reasoning for Video-based Human Pose Estimation

2026-03-20 · Quang Dang Huynh, Xuefei Yin, Andrew Busch, Hugo G. Espinosa 외 arxiv

Video-based human pose estimation remains challenged by motion blur, occlusion, and complex spatiotemporal dynamics. Existing methods often rely on heatmaps or implicit spatio-temporal feature aggregation, which limits j…

Pose Estimation

Geometric Mixture-of-Experts with Curvature-Guided Adaptive Routing for Graph Representation Learning

2026-03-20 · Haifang Cao, Yu Wang, Timing Li, Xinjie Yao 외 arxiv

Graph-structured data typically exhibits complex topological heterogeneity, making it difficult to model accurately within a single Riemannian manifold. While emerging mixed-curvature methods attempt to capture such dive…

Graph Representation Learning

SEA: Graph Shell Attention in Graph Neural Networks

2021-10-20 · Christian M. M. Frey, Yunpu Ma, Matthias Schubert

A common issue in Graph Neural Networks (GNNs) is known as over-smoothing. By increasing the number of iterations within the message-passing of GNNs, the nodes' representations of the input graph align with each other an…

Gate the Filter, Not the Message: Node-Channel Mixtures for Pre-Propagation GNNs

2026-06-01 · Zichao Yue, Zhiru Zhang arxiv

Pre-propagation graph neural networks (PPGNNs) push all graph-dependent computation into a preprocessing step and train only on the resulting dense hop features, which makes them highly scalable. A puzzle in this regime …