Xi Qin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Xi Qin has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Cheng Zhong
School of Computer, Electronics and Information, Guangxi University, Nanning, China
2 shared publications - Biao He
School of Computer, Electronics and Information, Guangxi University, Nanning 530004, China
1 shared publication - Cuimin Sun
School of Computer and Electronic Information Engineering, Guangxi University, Nanning 530004, China
1 shared publication - Hai Xiang Lin
Delft Institute of Applied Mathematics Delft University of Technology Delft the Netherlands
1 shared publication - Ji Liu
School of Computer, Electronics and Information, Guangxi University, Nanning 530004, China
1 shared publication - Liuxue Huang
School of Computer, Electronics and Information, Guangxi University, Nanning 530004, China
1 shared publication
Latest Publications
- Open Access
- 15 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 106-110
QMIX-Based Cooperative Coverage for Multi-UAV Systems in Grid Environments
- 15 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 106-110
Open AccessQMIX-Based Cooperative Coverage for Multi-UAV Systems in Grid Environments
- Open Access
SCBI-EfficientNetV2: A Lightweight Attention-Based Network for Regression Prediction of Nitrogen Content in Maize Leaves
Accurate assessment of nitrogen content in maize leaves is crucial for scientific fertilization and environmental protection in agricultural production. Traditional nutrient diagnosis methods are inefficient, costly, and destructive, while machine learning approaches based on handcrafted features rely heavily on manual design, leading to limited generalization ability and suboptimal prediction accuracy. To address these issues, this paper proposes a convolutional neural network model named SCBI-EfficientNetV2, which adopts EfficientNetV2-S as the backbone to overcome the limitations of manual feature engineering through automatic feature extraction. Furthermore, a Spatial and Channel Synergistic Attention (SCSA) module is introduced to enhance the modeling of critical regions and informative channels, and a Bidirectional Feature Pyramid Network (BiFPN) is incorporated to achieve effective multi-scale feature fusion, thereby improving the representation of hierarchical structural features in maize leaves. Experimental results show that SCBI-EfficientNetV2 achieves a coefficient of determination (R2) of 0.9417 on the test set, representing a 5.25% improvement over the baseline model and outperforming five classical deep learning approaches. In addition, the proposed model maintains high prediction accuracy with relatively low computational cost, demonstrating good adaptability for edge deployment. This study provides a feasible solution for non-destructive intelligent diagnosis of maize nutrition and offers technical support for precision fertilization and sustainable agricultural development.
Open AccessSCBI-EfficientNetV2: A Lightweight Attention-Based Network for Regression Prediction of Nitrogen Content in Maize Leaves
Accurate assessment of nitrogen content in maize leaves is crucial for scientific fertilization and environmental protection in agricultural production. Traditional nutrient diagnosis methods are inefficient, costly, and destructive, while machine learning approaches based on handcrafted features rely heavily on manual design, leading to limited generalization ability and suboptimal prediction accuracy. To address these issues, this paper proposes a convolutional neural network model named SCBI-EfficientNetV2, which adopts EfficientNetV2-S as the backbone to overcome the limitations of manual feature engineering through automatic feature extraction. Furthermore, a Spatial and Channel Synergistic Attention (SCSA) module is introduced to enhance the modeling of critical regions and informative channels, and a Bidirectional Feature Pyramid Network (BiFPN) is incorporated to achieve effective multi-scale feature fusion, thereby improving the representation of hierarchical structural features in maize leaves. Experimental results show that SCBI-EfficientNetV2 achieves a coefficient of determination (R2) of 0.9417 on the test set, representing a 5.25% improvement over the baseline model and outperforming five classical deep learning approaches. In addition, the proposed model maintains high prediction accuracy with relatively low computational cost, demonstrating good adaptability for edge deployment. This study provides a feasible solution for non-destructive intelligent diagnosis of maize nutrition and offers technical support for precision fertilization and sustainable agricultural development.
- Open Access
- 28 June 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 17 (8) , 1-21
Community-Based Influence Maximization Using Network Embedding in Dynamic Heterogeneous Social Networks
Influence maximization (IM) is a very important issue in social network diffusion analysis. The topology of real social network is large-scale, dynamic, and heterogeneous. The heterogeneity, and continuous expansion and evolution of social network pose a challenge to find influential users. Existing IM algorithms usually assume that social networks are static or dynamic but homogeneous to simplify the complexity of the IM problem. We propose a community-based influence maximization algorithm using network embedding in dynamic heterogeneous social networks. We use DyHATR algorithm to obtain the propagation feature vectors of network nodes, and executek-means cluster algorithm to transform the original network into a coarse granularity network (CGN). On CGN, we propose a community-based three-hop independent cascade model and construct the objective function of IM problem. We design a greedy heuristics algorithm to solve the IM problem with \((1-\frac{1}{e})-\) approximation guarantee and use community structure to quickly identify seed users and estimate their influence value. Experimental results on real social networks demonstrated that compared with existing IM algorithms, our proposed algorithm had better comprehensive performance with respect to the influence value, more less execution time and memory consumption, and better scalability.- 28 June 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 17 (8) , 1-21
Open AccessCommunity-Based Influence Maximization Using Network Embedding in Dynamic Heterogeneous Social Networks
Influence maximization (IM) is a very important issue in social network diffusion analysis. The topology of real social network is large-scale, dynamic, and heterogeneous. The heterogeneity, and continuous expansion and evolution of social network pose a challenge to find influential users. Existing IM algorithms usually assume that social networks are static or dynamic but homogeneous to simplify the complexity of the IM problem. We propose a community-based influence maximization algorithm using network embedding in dynamic heterogeneous social networks. We use DyHATR algorithm to obtain the propagation feature vectors of network nodes, and executek-means cluster algorithm to transform the original network into a coarse granularity network (CGN). On CGN, we propose a community-based three-hop independent cascade model and construct the objective function of IM problem. We design a greedy heuristics algorithm to solve the IM problem with \((1-\frac{1}{e})-\) approximation guarantee and use community structure to quickly identify seed users and estimate their influence value. Experimental results on real social networks demonstrated that compared with existing IM algorithms, our proposed algorithm had better comprehensive performance with respect to the influence value, more less execution time and memory consumption, and better scalability. - Open Access
- 15 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 9 (2) , 608-621
An Influence Maximization Algorithm Based on Community-Topic Features for Dynamic Social Networks
Real social networks are huge and continue to expand rapidly. Most existing dynamic influence maximization (IM) algorithms are based on the node-to-node propagation model; hence, they have high time complexity and large storage space consumption. They usually reduce computational complexity using a sampling method while sacrificing the influence spread. In this paper, we propose a topic-aware community independent cascade (IC) model to reduce the complexity of dynamic IM without losing accuracy. The proposed model reduces the problem domain through community-level propagation, and then enhances the global features by integrating community structural features, community topic features, and time information into an IC model. We construct the data structure of the dynamic community index to avoid recalculation when the network grows. Based on the dynamic community index, we design a dynamic IM algorithm to quickly approximate the solution with the (1-1/e)-approximation guarantee. The experimental results on real social networks demonstrated that, compared with existing IM algorithms, the proposed algorithm had better stability and dynamic adaptability, higher computational efficiency, and less space consumption without reducing the approximation ratio and influence spread.
- 15 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 9 (2) , 608-621
Open AccessAn Influence Maximization Algorithm Based on Community-Topic Features for Dynamic Social Networks
Real social networks are huge and continue to expand rapidly. Most existing dynamic influence maximization (IM) algorithms are based on the node-to-node propagation model; hence, they have high time complexity and large storage space consumption. They usually reduce computational complexity using a sampling method while sacrificing the influence spread. In this paper, we propose a topic-aware community independent cascade (IC) model to reduce the complexity of dynamic IM without losing accuracy. The proposed model reduces the problem domain through community-level propagation, and then enhances the global features by integrating community structural features, community topic features, and time information into an IC model. We construct the data structure of the dynamic community index to avoid recalculation when the network grows. Based on the dynamic community index, we design a dynamic IM algorithm to quickly approximate the solution with the (1-1/e)-approximation guarantee. The experimental results on real social networks demonstrated that, compared with existing IM algorithms, the proposed algorithm had better stability and dynamic adaptability, higher computational efficiency, and less space consumption without reducing the approximation ratio and influence spread.