Jinsong Chen

Dr. Jinsong Chen

Faculty of Artificial Intelligence in Education, Central China Normal University, Wuhan, Hubei, China
orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 April 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
JCJinsong Chen
Jinsong Chen
BLBoyu Li
Boyu Li
KHKun He
Kun He

30 December 2024 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
JCJinsong Chen
Jinsong Chen
CLChang Liu
Chang Liu
KGKaiyuan Gao
Kaiyuan Gao
GLGaichao Li
Gaichao Li
KHKun He
Kun He
Graph Transformers, emerging as a new architecture for graph representation learning, suffer from the quadratic complexity and can only handle graphs with at most thousands of nodes. To this end, we propose a Neighborhood Aggregation Graph Transformer (NAGphormer) that treats each node as a sequence containing a series of tokens constructed by our proposed Hop2Token module. For each node, Hop2Token aggregates the neighborhood features from different hops into different representations, producing a sequence of token vectors as one input. In this way, NAGphormer could be trained in a mini-batch manner and thus could scale to large graphs with millions of nodes. To further enhance the model's generalization, we propose NAGphormer+, an extended model of NAGphormer with a novel data augmentation method called Neighborhood Augmentation (NrAug). Based on the output of Hop2Token, NrAug simultaneously augments the features of neighborhoods from global as well as local views. In this way, NAGphormer+ can fully utilize the neighborhood information of multiple nodes, thereby undergoing more comprehensive training and improving the model's generalization capability. Extensive experiments on benchmark datasets from small to large demonstrate the superiority of NAGphormer+ against existing graph Transformers and mainstream GNNs, as well as the original NAGphormer.

9 May 2024 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
JCJinsong Chen
Jinsong Chen
BLBoyu Li
Boyu Li
QHQiuting He
Qiuting He
KHKun He
Kun He
Semisupervised node classification on attributed networks is a crucial task for network analysis. By decoupling two critical operations in graph convolutional networks (GCNs), namely feature transformation and neighborhood aggregation, recent works of decoupled GCNs could support the information to propagate deeper and achieve advanced performance on node classification. However, they follow the structure-aware propagation strategy of GCNs, making it hard to capture the attribute correlation of nodes and be sensitive to the structure noise described by edges whose two endpoints belong to different categories. To address these issues, we propose a new method called the propagation with adaptive mask then training (PAMT). The key idea is to integrate the attribute similarity mask into the structure-aware propagation process. In this way, PAMT could preserve the attribute correlation of adjacent nodes during the propagation and effectively reduce the influence of structure noise. Moreover, we develop an iterative refinement mechanism to update the similarity mask during the training process to improve the training performance. Extensive experiments on six real-world datasets demonstrate the superior performance and robustness of PAMT over the state-of-the-art baselines.

1 November 2022
Verified
Conference Paper
Closed access
QHQiuting He
Qiuting He
JCJinsong Chen
Jinsong Chen
HXHao Xu
Hao Xu
KHKun He
Kun He
Label propagation and graph neural networks are two main methods for the semi-supervised node classification problem on graphs. They share similar idea of propagating information over the network, exhibiting promising performance on the node classification task. Despite effectiveness, the limitations of these propagation methods are still not well understood. From the perspective of label propagation then training, we observe three major challenges of these propagation methods. The observations from both theoretical analyses and empirical studies reveal that the propagation operations can degrade performance on certain labels and suffers from structure noise, which is described by edges with two nodes belonging to distinct labels. To address the above issues, we propose a new method termed Robust Label Propagation (RLP). RLP contains two novel strategies, Robust Training and Ada-Mixup. Robust Training can utilize more attribute information to have the overall training correction ability and alleviate the impact of structure noise significantly. Ada-Mixup can help RLP mine useful structure information by integrating information before and after the propagation adaptively. Extensive empirical studies on real-world datasets demonstrate that RLP outperforms the mainstream baselines on the node classification task in terms of effectiveness, efficiency and robustness.

23 October 2025 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
JCJinsong Chen
Jinsong Chen
SJSiyu Jiang
Siyu Jiang
KHKun He
Kun He
Tokenized graph Transformers have advanced node classification by transforming graphs into token sequences, but existing methods suffer from limited flexibility due to single-type token generation, which captures partial graph information and requires tailored modifications. To address this, we propose NTFormer, a novel graph Transformer with a dedicated token generator called Node2Par. Node2Par constructs diverse token sequences for each node using multiple token elements (i.e., neighborhood tokens and node tokens) from both topology view and attribute view, enabling comprehensive expression of graph features from multi-perspectives. Leveraging the outputs of Node2Pars, NTFormer adopts a standard Transformer backbone without additional graph-aware modules and a learnable information fusion strategy to adaptively learn expressive node representations from generated different token sequences, eliminating the need for tailored encoding strategies. Extensive experiments on benchmark datasets including homophily and heterophily graphs showcase that NTFormer outperforms representative graph Transformers and GNNs in node classification.

28 May 2025 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
JCJinsong Chen
Jinsong Chen
MWMeng Wang
Meng Wang
KHKun He
Kun He