Xizhong Qin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xizhong Qin has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Wensheng Ran
Xinjiang Uygur Autonomous Regin Product Quality Supervision and Inspection Institute, Urumqi 830049, China
4 shared publications - Zhenhong Jia
School of Computer Science and Technology, Xinjiang University, Urumqi 830046, China
4 shared publications - Junbao Liu
College of Information Science and Engineering, Xinjiang University, Urumqi 830049, China
3 shared publications - Li Tang
Network Department, China Mobile Communications Group Xinjiang Co., Ltd., Urumqi 830000, China
3 shared publications - Xiaoqin Ma
College of Information Science and Engineering, Xinjiang University, Urumqi 830049, China
3 shared publications - Yan Huang
Network Department, China Mobile Communications Group Xinjiang Co., Ltd., Urumqi 830000, China
3 shared publications
Latest Publications
- 21 August 2025
- Published by Springer Nature in Multimedia Systems
- Vol. 31 (5) , 1-25
MTSMNet: a multi-scale trend-seasonal mixing network for long-term time series forecasting
- 21 August 2025
- Published by Springer Nature in Multimedia Systems
- Vol. 31 (5) , 1-25
MTSMNet: a multi-scale trend-seasonal mixing network for long-term time series forecasting
- 17 July 2025
- Published by Springer Nature
- p. 213-224
Drug–Target Binding Affinity Prediction Based on an Improved Kolmogorov–Arnold Network and Pretrained Models
- 17 July 2025
- Published by Springer Nature
- p. 213-224
Drug–Target Binding Affinity Prediction Based on an Improved Kolmogorov–Arnold Network and Pretrained Models
- 17 July 2025
- Published by Springer Nature
- p. 58-68
FPLRDGraph-DTA: Fusing Prior Features and Long-Range Dependent Sequence Features for Drug-Target Affinity Prediction
- 17 July 2025
- Published by Springer Nature
- p. 58-68
FPLRDGraph-DTA: Fusing Prior Features and Long-Range Dependent Sequence Features for Drug-Target Affinity Prediction
- 14 November 2024
- Published by Springer Nature
- p. 387-399
Joint Optimization of Maximum Achievable Rate in SWIPT Systems Assisted by Active STAR-RIS
- 14 November 2024
- Published by Springer Nature
- p. 387-399
Joint Optimization of Maximum Achievable Rate in SWIPT Systems Assisted by Active STAR-RIS
- Open Access
- 16 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (16) , 9304
Dynamic Spatio-Temporal Graph Fusion Convolutional Network for Urban Traffic Prediction
Urban traffic prediction is essential for intelligent transportation systems. However, traffic data often exhibit highly complex spatio-temporal correlations, posing challenges for accurate forecasting. Graph neural networks have demonstrated an outstanding ability in capturing spatial correlations and are now extensively applied to traffic prediction. However, many graph-based methods neglect the dynamic spatial features between road segments and the continuity of spatial features across adjacent time steps, leading to subpar predictive performance. This paper proposes a Dynamic Spatio-Temporal Graph Fusion Convolutional Network (DSTGFCN) to enhance the accuracy of traffic prediction. Specifically, we designed a dynamic graph fusion module without prior road spatial information, which extracts dynamic spatial information among roads from observed data. Subsequently, we fused the dynamic spatial features of the current time step and adjacent time steps to generate a dynamic graph for each time step. The graph convolutional gated recurrent network was employed to model the spatio-temporal correlations jointly. Additionally, residual connections were added to the model to enhance the ability to extract long-term temporal relationships. Finally, we conducted experiments on six publicly available traffic datasets, and the results demonstrated that DSTGFCN outperforms the baseline models with state-of-the-art predictive performance.
- 16 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (16) , 9304
Open AccessDynamic Spatio-Temporal Graph Fusion Convolutional Network for Urban Traffic Prediction
Urban traffic prediction is essential for intelligent transportation systems. However, traffic data often exhibit highly complex spatio-temporal correlations, posing challenges for accurate forecasting. Graph neural networks have demonstrated an outstanding ability in capturing spatial correlations and are now extensively applied to traffic prediction. However, many graph-based methods neglect the dynamic spatial features between road segments and the continuity of spatial features across adjacent time steps, leading to subpar predictive performance. This paper proposes a Dynamic Spatio-Temporal Graph Fusion Convolutional Network (DSTGFCN) to enhance the accuracy of traffic prediction. Specifically, we designed a dynamic graph fusion module without prior road spatial information, which extracts dynamic spatial information among roads from observed data. Subsequently, we fused the dynamic spatial features of the current time step and adjacent time steps to generate a dynamic graph for each time step. The graph convolutional gated recurrent network was employed to model the spatio-temporal correlations jointly. Additionally, residual connections were added to the model to enhance the ability to extract long-term temporal relationships. Finally, we conducted experiments on six publicly available traffic datasets, and the results demonstrated that DSTGFCN outperforms the baseline models with state-of-the-art predictive performance.
- Open Access
- 13 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (16) , 9200
Local Feature Enhancement for Nested Entity Recognition Using a Convolutional Block Attention Module
Named entity recognition involves two main types: nested named entity recognition and flat named entity recognition. The span-based approach treats nested entities and flat entities uniformly by classifying entities on a span representation. However, the span-based approach ignores the local features within the entities and the relative position features between the head and tail tokens, which affects the performance of entity recognition. To address these issues, we propose a nested entity recognition model using a convolutional block attention module and rotary position embedding for local features and relative position features enhancement. Specifically, we apply rotary position embedding to the sentence representation and capture the semantic information between the head and tail tokens using a biaffine attention mechanism. Meanwhile, the convolution module captures the local features within the entity to generate the span representation. Finally, the two parts of the representation are fused for entity classification. Extensive experiments were conducted on five widely used benchmark datasets to demonstrate the effectiveness of our proposed model.
- 13 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (16) , 9200
Open AccessLocal Feature Enhancement for Nested Entity Recognition Using a Convolutional Block Attention Module
Named entity recognition involves two main types: nested named entity recognition and flat named entity recognition. The span-based approach treats nested entities and flat entities uniformly by classifying entities on a span representation. However, the span-based approach ignores the local features within the entities and the relative position features between the head and tail tokens, which affects the performance of entity recognition. To address these issues, we propose a nested entity recognition model using a convolutional block attention module and rotary position embedding for local features and relative position features enhancement. Specifically, we apply rotary position embedding to the sentence representation and capture the semantic information between the head and tail tokens using a biaffine attention mechanism. Meanwhile, the convolution module captures the local features within the entity to generate the span representation. Finally, the two parts of the representation are fused for entity classification. Extensive experiments were conducted on five widely used benchmark datasets to demonstrate the effectiveness of our proposed model.
- Open Access
- 9 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (16) , 9093
Prompt-Based Graph Convolution Adversarial Meta-Learning for Few-Shot Text Classification
Deep learning techniques have demonstrated significant advancements in the task of text classification. Regrettably, the majority of these techniques necessitate a substantial corpus of annotated data to achieve optimal performance. Meta-learning has yielded intriguing outcomes in few-shot learning tasks, showcasing its potential in advancing the field. However, the current meta-learning methodologies are susceptible to overfitting due to the mismatch between a small number of samples and the complexity of the model. To mitigate this concern, we propose a Prompt-based Graph Convolutional Adversarial (PGCA) meta-learning framework, aiming to improve the adaptability of complex models in a few-shot scenario. Firstly, leveraging prompt learning, we generate embedding representations that bridge the downstream tasks. Then, we design a meta-knowledge extractor based on a graph convolutional neural network (GCN) to capture inter-class dependencies through instance-level interactions. We also integrate the adversarial network architecture into a meta-learning framework to extend sample diversity through adversarial training and improve the ability of the model to adapt to new tasks. Specifically, we mitigate the impact of extreme samples by introducing external knowledge to construct a list of class prototype extensions. Finally, we conduct a series of experiments on four public datasets to demonstrate the effectiveness of our proposed method.
- 9 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (16) , 9093
Open AccessPrompt-Based Graph Convolution Adversarial Meta-Learning for Few-Shot Text Classification
Deep learning techniques have demonstrated significant advancements in the task of text classification. Regrettably, the majority of these techniques necessitate a substantial corpus of annotated data to achieve optimal performance. Meta-learning has yielded intriguing outcomes in few-shot learning tasks, showcasing its potential in advancing the field. However, the current meta-learning methodologies are susceptible to overfitting due to the mismatch between a small number of samples and the complexity of the model. To mitigate this concern, we propose a Prompt-based Graph Convolutional Adversarial (PGCA) meta-learning framework, aiming to improve the adaptability of complex models in a few-shot scenario. Firstly, leveraging prompt learning, we generate embedding representations that bridge the downstream tasks. Then, we design a meta-knowledge extractor based on a graph convolutional neural network (GCN) to capture inter-class dependencies through instance-level interactions. We also integrate the adversarial network architecture into a meta-learning framework to extend sample diversity through adversarial training and improve the ability of the model to adapt to new tasks. Specifically, we mitigate the impact of extreme samples by introducing external knowledge to construct a list of class prototype extensions. Finally, we conduct a series of experiments on four public datasets to demonstrate the effectiveness of our proposed method.
- Open Access
- 26 July 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (15) , 8609
SLNER: Chinese Few-Shot Named Entity Recognition with Enhanced Span and Label Semantics
Few-shot named entity recognition requires sufficient prior knowledge to transfer valuable knowledge to the target domain with only a few labeled examples. Existing Chinese few-shot named entity recognition methods suffer from inadequate prior knowledge and limitations in feature representation. In this paper, we utilize enhanced Span and Label semantic representations for Chinese few-shot Named Entity Recognition (SLNER) to address the problem. Specifically, SLNER utilizes two encoders. One encoder is used to encode the text and its spans, and we employ the biaffine attention mechanism and self-attention to obtain enhanced span representations. This approach fully leverages the internal composition of entity mentions, leading to more accurate feature representations. The other encoder encodes the full label names to obtain label representations. Label names are broad representations of specific entity categories and share similar semantic meanings with entities. This similarity allows label names to offer valuable prior knowledge in few-shot scenarios. Finally, our model learns to match span representations with label representations. We conducted extensive experiments on three sampling benchmark Chinese datasets and a self-built food safety risk domain dataset. The experimental results show that our model outperforms the F1 scores of 0.20–6.57% of previous state-of-the-art methods in few-shot settings.
- 26 July 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (15) , 8609
Open AccessSLNER: Chinese Few-Shot Named Entity Recognition with Enhanced Span and Label Semantics
Few-shot named entity recognition requires sufficient prior knowledge to transfer valuable knowledge to the target domain with only a few labeled examples. Existing Chinese few-shot named entity recognition methods suffer from inadequate prior knowledge and limitations in feature representation. In this paper, we utilize enhanced Span and Label semantic representations for Chinese few-shot Named Entity Recognition (SLNER) to address the problem. Specifically, SLNER utilizes two encoders. One encoder is used to encode the text and its spans, and we employ the biaffine attention mechanism and self-attention to obtain enhanced span representations. This approach fully leverages the internal composition of entity mentions, leading to more accurate feature representations. The other encoder encodes the full label names to obtain label representations. Label names are broad representations of specific entity categories and share similar semantic meanings with entities. This similarity allows label names to offer valuable prior knowledge in few-shot scenarios. Finally, our model learns to match span representations with label representations. We conducted extensive experiments on three sampling benchmark Chinese datasets and a self-built food safety risk domain dataset. The experimental results show that our model outperforms the F1 scores of 0.20–6.57% of previous state-of-the-art methods in few-shot settings.
- Open Access
- 18 July 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (14) , 8312
FREDA: Few-Shot Relation Extraction Based on Data Augmentation
The primary task of few-shot relation extraction is to quickly learn the features of relation classes from a few labelled instances and predict the semantic relations between entity pairs in new instances. Most existing few-shot relation extraction methods do not fully utilize the relation information features in sentences, resulting in difficulties in improving the performance of relation classification. Some researchers have attempted to incorporate external information, but the results have been unsatisfactory when applied to different domains. In this paper, we propose a method that utilizes triple information for data augmentation, which can alleviate the issue of insufficient instances and possesses strong domain adaptation capabilities. Firstly, we extract relation and entity pairs from the instances in the support set, forming relation triple information. Next, the sentence information and relation triple information are encoded using the same sentence encoder. Then, we construct an interactive attention module to enable the query set instances to interact separately with the support set instances and relation triple instances. The module pays greater attention to highly interactive parts between instances and assigns them higher weights. Finally, we merge the interacted support set representation and relation triple representation. To our knowledge, we are the first to propose a method that utilizes triple information for data augmentation in relation extraction. In our experiments on the standard datasets FewRel1.0 and FewRel2.0 (domain adaptation), we observed substantial improvements without including external information.
- 18 July 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (14) , 8312
Open AccessFREDA: Few-Shot Relation Extraction Based on Data Augmentation
The primary task of few-shot relation extraction is to quickly learn the features of relation classes from a few labelled instances and predict the semantic relations between entity pairs in new instances. Most existing few-shot relation extraction methods do not fully utilize the relation information features in sentences, resulting in difficulties in improving the performance of relation classification. Some researchers have attempted to incorporate external information, but the results have been unsatisfactory when applied to different domains. In this paper, we propose a method that utilizes triple information for data augmentation, which can alleviate the issue of insufficient instances and possesses strong domain adaptation capabilities. Firstly, we extract relation and entity pairs from the instances in the support set, forming relation triple information. Next, the sentence information and relation triple information are encoded using the same sentence encoder. Then, we construct an interactive attention module to enable the query set instances to interact separately with the support set instances and relation triple instances. The module pays greater attention to highly interactive parts between instances and assigns them higher weights. Finally, we merge the interacted support set representation and relation triple representation. To our knowledge, we are the first to propose a method that utilizes triple information for data augmentation in relation extraction. In our experiments on the standard datasets FewRel1.0 and FewRel2.0 (domain adaptation), we observed substantial improvements without including external information.
- Open Access
- 3 July 2023
- Published by MDPI AG in Electronics
- Vol. 12 (13) , 2912
Interaction Information Guided Prototype Representation Rectification for Few-Shot Relation Extraction
Few-shot relation extraction aims to identify and extract semantic relations between entity pairs using only a small number of annotated instances. Many recently proposed prototype-based methods have shown excellent performance. However, existing prototype-based methods ignore the hidden inter-instance interaction information between the support and query sets, leading to unreliable prototypes. In addition, the current optimization of the prototypical network only relies on cross-entropy loss. It is only concerned with the accuracy of the predicted probability for the correct label, ignoring the differences of other non-correct labels, which cannot account for relation discretization in semantic space. This paper proposes an attentional network of interaction information to obtain a more reliable relation prototype. Firstly, an inter-instance interaction information attention module is designed to mitigate prototype unreliability through interaction information between the support set and query set instances, utilizing category information hidden in the query set. Secondly, the similarity scalar, which is defined by the mixed features of the prototype and the relation and is added to the focal loss to improve the attention of hard examples. We conducted extensive experiments on two standard datasets and demonstrated the validity of our proposed model.
- 3 July 2023
- Published by MDPI AG in Electronics
- Vol. 12 (13) , 2912
Open AccessInteraction Information Guided Prototype Representation Rectification for Few-Shot Relation Extraction
Few-shot relation extraction aims to identify and extract semantic relations between entity pairs using only a small number of annotated instances. Many recently proposed prototype-based methods have shown excellent performance. However, existing prototype-based methods ignore the hidden inter-instance interaction information between the support and query sets, leading to unreliable prototypes. In addition, the current optimization of the prototypical network only relies on cross-entropy loss. It is only concerned with the accuracy of the predicted probability for the correct label, ignoring the differences of other non-correct labels, which cannot account for relation discretization in semantic space. This paper proposes an attentional network of interaction information to obtain a more reliable relation prototype. Firstly, an inter-instance interaction information attention module is designed to mitigate prototype unreliability through interaction information between the support set and query set instances, utilizing category information hidden in the query set. Secondly, the similarity scalar, which is defined by the mixed features of the prototype and the relation and is added to the focal loss to improve the attention of hard examples. We conducted extensive experiments on two standard datasets and demonstrated the validity of our proposed model.