Dual-Pathway Feature Fusion Graph Transformer

Graph Neural Networks (GNNs) still suffer from performance degradation in node classification tasks due to information aggregation limitations and the over-smoothing phenomenon. To address these challenges, this paper proposes an innovative GNN model named the Dual-Pathway Feature Fusion Graph Transformer (DPFFGT), which combines a global attention mechanism with node feature convolution.this work introduces a global attention mechanism from graph Transformers. By employing parallel weighted operations, this approach enhances the neighborhood information aggregation capability of Graph Convolutional Networks (GCNs) while preventing information loss. Experimental results demonstrate that the proposed model achieves significant performance improvements in node classification tasks. Particularly on imbalanced datasets, it effectively enhances classification accuracy, mitigates over-smoothing, and optimizes graph structures. This study provides a novel solution for applying graph neural networks to node classification tasks, offering both theoretical and practical value.

Institutions

Publication Details

Published
2025-05-17
DOI
https://doi.org/10.1109/yac66630.2025.11150024
Primary Topic
Canadian Policy and Governance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dual-Pathway Feature Fusion Graph Transformer

Canadian Policy and Governance
article

Dual-Pathway Feature Fusion Graph Transformer

article en

Abstract

Graph Neural Networks (GNNs) still suffer from performance degradation in node classification tasks due to information aggregation limitations and the over-smoothing phenomenon. To address these challenges, this paper proposes an innovative GNN model named the Dual-Pathway Feature Fusion Graph Transformer (DPFFGT), which combines a global attention mechanism with node feature convolution.this work introduces a global attention mechanism from graph Transformers. By employing parallel weighted operations, this approach enhances the neighborhood information aggregation capability of Graph Convolutional Networks (GCNs) while preventing information loss. Experimental results demonstrate that the proposed model achieves significant performance improvements in node classification tasks. Particularly on imbalanced datasets, it effectively enhances classification accuracy, mitigates over-smoothing, and optimizes graph structures. This study provides a novel solution for applying graph neural networks to node classification tasks, offering both theoretical and practical value.

Lanzhou University of Technology (CN)
Affordable and clean energy
Openalex Percentile: Top 39%
Canadian Policy and Governance
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.