Kuijie Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kuijie Zhang has a total of 64 co-authors. Here are the top co-authors by number of shared publications:
- Shanchen Pang
Qingdao Institute of Software, College of Computer Science and Technology, China University of Petroleum (East China), Qingdao, China
13 shared publications - Shudong Wang
College of Computer Science and Technology, China University of Petroleum (East China), Qingdao, China
8 shared publications - Yuanyuan Zhang
School of Information and Control Engineering, Qingdao University of Technology, Qingdao, China
6 shared publications - Wenhao Wu
College of Computer Science and Technology, Qingdao Institute of Software
4 shared publications - Hongjuan Pei
School of Engineering Science, University of Chinese Academy of Sciences, Beijing, China
3 shared publications - Sibo Qiao
School of Software, Tiangong University, Tianjin, China
3 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 37 (11) , 6565-6579
TSGNAS: A Topology- and Semantic-Guided Graph Neural Network Architecture Searcher
Designing effective graph neural networks (GNNs) for diverse tasks requires substantial manual effort, especially when dealing with the intricate interplay between topological structures and semantic information in graph data. Existing automated approaches often rely on off-the-shelf model combinations that remain superficial, resulting in generated model frameworks that are hardly interpretable and limited by the capabilities of the combined models. To address this gap, we propose an evolutionary-based framework that systematically searches for optimal GNN architectures while adaptively combining topological and semantic insights. This approach reduces human intervention, accommodates a wide range of graph tasks, and ensures robust performance in complex scenarios. Extensive experiments on real-world datasets demonstrate that our method outperforms both handcrafted GNNs and mainstream AutoML models in terms of accuracy, offering a scalable and adaptive solution for GNN design.
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 37 (11) , 6565-6579
TSGNAS: A Topology- and Semantic-Guided Graph Neural Network Architecture Searcher
Designing effective graph neural networks (GNNs) for diverse tasks requires substantial manual effort, especially when dealing with the intricate interplay between topological structures and semantic information in graph data. Existing automated approaches often rely on off-the-shelf model combinations that remain superficial, resulting in generated model frameworks that are hardly interpretable and limited by the capabilities of the combined models. To address this gap, we propose an evolutionary-based framework that systematically searches for optimal GNN architectures while adaptively combining topological and semantic insights. This approach reduces human intervention, accommodates a wide range of graph tasks, and ensures robust performance in complex scenarios. Extensive experiments on real-world datasets demonstrate that our method outperforms both handcrafted GNNs and mainstream AutoML models in terms of accuracy, offering a scalable and adaptive solution for GNN design.
- Open Access
- 6 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 367-372
STIGNN: Spatio-Temporal Graph Neural Networks for Traffic Flow Forecasting
Accurate traffic flow forecasting is a fundamental yet challenging task in intelligent transportation systems, because of the highly nonlinear and complex nature of traffic dynamics. This paper presents a novel Spatio-Temporal Graph Neural Network with Integrated Semantics and Topology (STIGNN). Unlike existing approaches, STIGNN jointly exploits node-level semantic features and graph topological dependencies to enhance spatial representation learning. Specifically, spatial correlations are captured through a ChebNet–GAT hybrid mechanism, which combines multi-hop structural information with semantic attention. Temporal dependencies are modeled using a Gated Temporal Convolutional Network (Gated TCN), enabling efficient learning of long-range sequences. Furthermore, the dual-attention design over node semantics and network topology allows STIGNN to be directly applied to inductive prediction tasks, ensuring strong generalization across diverse network settings. Extensive experiments on two real-world benchmark datasets, METR-LA and PEMS-BAY, demonstrate that STIGNN consistently outperforms state-of-the-art baselines.
- 6 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 367-372
Open AccessSTIGNN: Spatio-Temporal Graph Neural Networks for Traffic Flow Forecasting
Accurate traffic flow forecasting is a fundamental yet challenging task in intelligent transportation systems, because of the highly nonlinear and complex nature of traffic dynamics. This paper presents a novel Spatio-Temporal Graph Neural Network with Integrated Semantics and Topology (STIGNN). Unlike existing approaches, STIGNN jointly exploits node-level semantic features and graph topological dependencies to enhance spatial representation learning. Specifically, spatial correlations are captured through a ChebNet–GAT hybrid mechanism, which combines multi-hop structural information with semantic attention. Temporal dependencies are modeled using a Gated Temporal Convolutional Network (Gated TCN), enabling efficient learning of long-range sequences. Furthermore, the dual-attention design over node semantics and network topology allows STIGNN to be directly applied to inductive prediction tasks, ensuring strong generalization across diverse network settings. Extensive experiments on two real-world benchmark datasets, METR-LA and PEMS-BAY, demonstrate that STIGNN consistently outperforms state-of-the-art baselines.
- 3 January 2026
- Published by Elsevier in Pattern Recognition
- Vol. 175
Enhancing semi-supervised medical image segmentation via semantic transfer
- 3 January 2026
- Published by Elsevier in Pattern Recognition
- Vol. 175
Enhancing semi-supervised medical image segmentation via semantic transfer
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 11802-11816
HCAO: LLM-GAT Enhanced Offloading Decision for Asynchronous IoLoUA Systems
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 11802-11816
HCAO: LLM-GAT Enhanced Offloading Decision for Asynchronous IoLoUA Systems
- Open Access
- 12 November 2025
- Published by Springer Nature in Research Square
MPRW-HGNN: A Meta-path Random Walk based Heterogeneous Graph Neural Network
In recent years, graph neural networks have been widely used in multimedia information retrieval and other graph data processing tasks due to their powerful feature learning capabilities. However, existing graph neural network models typically handle only homogeneous graph data with simple structures and single semantics effectively. However, when faced with heterogeneous multimedia data characterized by complex interactions and rich semantics, the performance of traditional models degrades significantly. To address this challenge, this paper proposes a heterogeneous graph neural network algorithm based on meta-path random walk (MPRW-HGNN). First, we design a module at the meta-path instance level that generates meta-path instances and their structural representations via random walks. Then, a soft-attention mechanism is employed to fuse information from multiple meta-paths, better capturing the fine-grained semantic structures around nodes. Subsequently, we utilize a self-attention mechanism to explore semantic correlations and differences between multiple paths, enabling adaptive weighted fusion of multiple path information to generate robust node features for heterogeneous graph data. Through extensive experiments on information retrieval tasks using the IMDB movie dataset and DBLP academic paper dataset, we demonstrate the significant advantages of our proposed algorithm in handling multimodal data and improving retrieval accuracy.
- 12 November 2025
- Published by Springer Nature in Research Square
Open AccessMPRW-HGNN: A Meta-path Random Walk based Heterogeneous Graph Neural Network
In recent years, graph neural networks have been widely used in multimedia information retrieval and other graph data processing tasks due to their powerful feature learning capabilities. However, existing graph neural network models typically handle only homogeneous graph data with simple structures and single semantics effectively. However, when faced with heterogeneous multimedia data characterized by complex interactions and rich semantics, the performance of traditional models degrades significantly. To address this challenge, this paper proposes a heterogeneous graph neural network algorithm based on meta-path random walk (MPRW-HGNN). First, we design a module at the meta-path instance level that generates meta-path instances and their structural representations via random walks. Then, a soft-attention mechanism is employed to fuse information from multiple meta-paths, better capturing the fine-grained semantic structures around nodes. Subsequently, we utilize a self-attention mechanism to explore semantic correlations and differences between multiple paths, enabling adaptive weighted fusion of multiple path information to generate robust node features for heterogeneous graph data. Through extensive experiments on information retrieval tasks using the IMDB movie dataset and DBLP academic paper dataset, we demonstrate the significant advantages of our proposed algorithm in handling multimodal data and improving retrieval accuracy.
- 29 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (3) , 7559-7569
Learning Three-Modal Joint Representations With Multimodal Transformer for Multimodal Sentiment Analysis
Understanding user sentiment from multiple modalities is essential for applications such as personalized recommendations and affective computing. We propose TMJR, a Three-modal Joint Representation model for multimodal sentiment analysis, which introduces a structured three-round cross-modal attention mechanism to integrate textual, acoustic, and visual information progressively. Unlike prior one-pass or pairwise fusion methods, TMJR models multiple directional interaction paths to capture deeper cross-modal dependencies and improve semantic alignment. We evaluate TMJR on two benchmark datasets: CMU-MOSI and CMU-MOSEI. It achieves state-of-the-art results, with an F1 score of 86.4% and a Pearson correlation of 0.799 on MOSI, and an F1 score of 86.5% and a correlation of 0.775 on MOSEI. Further ablation, label-efficiency, and visualization analyses confirm the model’s robustness. TMJR provides a promising solution for sentiment-aware recommendation and multimodal user understanding.
- 29 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (3) , 7559-7569
Learning Three-Modal Joint Representations With Multimodal Transformer for Multimodal Sentiment Analysis
Understanding user sentiment from multiple modalities is essential for applications such as personalized recommendations and affective computing. We propose TMJR, a Three-modal Joint Representation model for multimodal sentiment analysis, which introduces a structured three-round cross-modal attention mechanism to integrate textual, acoustic, and visual information progressively. Unlike prior one-pass or pairwise fusion methods, TMJR models multiple directional interaction paths to capture deeper cross-modal dependencies and improve semantic alignment. We evaluate TMJR on two benchmark datasets: CMU-MOSI and CMU-MOSEI. It achieves state-of-the-art results, with an F1 score of 86.4% and a Pearson correlation of 0.799 on MOSI, and an F1 score of 86.5% and a correlation of 0.775 on MOSEI. Further ablation, label-efficiency, and visualization analyses confirm the model’s robustness. TMJR provides a promising solution for sentiment-aware recommendation and multimodal user understanding.
- 26 June 2025
- Published by Elsevier in Information Sciences
- Vol. 719
Dynamic sequential neighbor processing: A liquid neural network-inspired framework for enhanced graph neural networks
- 26 June 2025
- Published by Elsevier in Information Sciences
- Vol. 719
Dynamic sequential neighbor processing: A liquid neural network-inspired framework for enhanced graph neural networks
- 18 June 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 325
Fed3Scale: A cloud-edge-client tri-scale collaborative semi-supervised hierarchical federated learning framework
- 18 June 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 325
Fed3Scale: A cloud-edge-client tri-scale collaborative semi-supervised hierarchical federated learning framework
- 15 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (6) , 10764-10778
Convolution Bridge: An Effective Algorithmic Migration Strategy From CNNs to GNNs
Graph neural networks (GNNs), as a rising star in machine learning, are widely used in relational data models and have achieved outstanding performance in graph tasks. GNN continuously takes inspiration from mature models in other domains such as computer vision and natural language processing to motivate the development of graph algorithms. However, due to the various data structures from different domains, the cross-domain migration of models has to go through a long period of disassembly and reconstruction, which may not yield the desired results. To preserve the excellent properties of convolution and optimize the migration process from convolutional neural networks (CNNs) to GNNs, we propose a convolution bridge. The convolution bridge realizes the data alignment from CNN to GNN, so that the CNN-based model can be efficiently migrated to the graph structure model. To demonstrate the effectiveness of our migration strategy, we migrated the inception module and U-Net architecture from CNNs to GNNs, named GraInc and GraU-Net, for the node-level task and the graph-level task, respectively. Experimental results show that GraInc and GraU-Net are highly competitive compared to the current state-of-the-art models, particularly on dense graph datasets.
- 15 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (6) , 10764-10778
Convolution Bridge: An Effective Algorithmic Migration Strategy From CNNs to GNNs
Graph neural networks (GNNs), as a rising star in machine learning, are widely used in relational data models and have achieved outstanding performance in graph tasks. GNN continuously takes inspiration from mature models in other domains such as computer vision and natural language processing to motivate the development of graph algorithms. However, due to the various data structures from different domains, the cross-domain migration of models has to go through a long period of disassembly and reconstruction, which may not yield the desired results. To preserve the excellent properties of convolution and optimize the migration process from convolutional neural networks (CNNs) to GNNs, we propose a convolution bridge. The convolution bridge realizes the data alignment from CNN to GNN, so that the CNN-based model can be efficiently migrated to the graph structure model. To demonstrate the effectiveness of our migration strategy, we migrated the inception module and U-Net architecture from CNNs to GNNs, named GraInc and GraU-Net, for the node-level task and the graph-level task, respectively. Experimental results show that GraInc and GraU-Net are highly competitive compared to the current state-of-the-art models, particularly on dense graph datasets.