Qing Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Qing Li has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Kun Chen
Department of Information System Engineering, PLA Strategic Support Force Information Engineering University, Zhengzhou 450001, China
3 shared publications - Xiangwei Bai
National Digital Switching System Engineering and Technological Research Center (NDSC), Zhengzhou 450001, China
3 shared publications - Runze Wang
Department of Information System Engineering, PLA Strategic Support Force Information Engineering University, Zhengzhou 450001, China
2 shared publications - Siyu Tao
National Digital Switching System Engineering and Technological Research Center (NDSC), Zhengzhou 450001, China
2 shared publications - Xintai He
Department of Information System Engineering, PLA Strategic Support Force Information Engineering University, Zhengzhou 450001, China
2 shared publications - Yanqun Tang
Sun Yat-sen University
2 shared publications
Latest Publications
- Open Access
- 29 October 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (21) , 10979
A Two-Stage Semi-Supervised High Maneuvering Target Trajectory Data Classification Algorithm
Labeled data in insufficient amounts and missing categories are two observable features for high maneuvering target trajectory data. However, the existing research achievements are insufficient for solving these two problems simultaneously during data classification. This study proposed a two-stage semi-supervised trajectory data classification algorithm. By pre-training the autoencoder and combining it with the Siamese network, a two-stage joint training was formed, which enabled the model to deal with missing categories by clustering and maintaining the classification ability under the missing label categories. The experimental simulation results showed that the performance of this algorithm was better than the classical semi-supervised algorithm label propagation and transferred learning when the amount of various labeled data was as low as 1–5. The two-stage training model also had a good effect on the problem of missing categories. When 75% of the types were missing, the purity could still reach 82%, which was about eight percentage points higher than the directly trained network. When two problems appeared simultaneously, compared with the directly trained network, the performance improved by about three percentage points on average, and the purity was consistently higher than the clustering results. In summary, this algorithm was more tolerant of the problems of labeled datasets, so it was more practical.
- 29 October 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (21) , 10979
Open AccessA Two-Stage Semi-Supervised High Maneuvering Target Trajectory Data Classification Algorithm
Labeled data in insufficient amounts and missing categories are two observable features for high maneuvering target trajectory data. However, the existing research achievements are insufficient for solving these two problems simultaneously during data classification. This study proposed a two-stage semi-supervised trajectory data classification algorithm. By pre-training the autoencoder and combining it with the Siamese network, a two-stage joint training was formed, which enabled the model to deal with missing categories by clustering and maintaining the classification ability under the missing label categories. The experimental simulation results showed that the performance of this algorithm was better than the classical semi-supervised algorithm label propagation and transferred learning when the amount of various labeled data was as low as 1–5. The two-stage training model also had a good effect on the problem of missing categories. When 75% of the types were missing, the purity could still reach 82%, which was about eight percentage points higher than the directly trained network. When two problems appeared simultaneously, compared with the directly trained network, the performance improved by about three percentage points on average, and the purity was consistently higher than the clustering results. In summary, this algorithm was more tolerant of the problems of labeled datasets, so it was more practical.
- Open Access
- 22 July 2022
- Published by MDPI AG in Electronics
- Vol. 11 (15) , 2283
A Spatio-Temporal Feature Trajectory Clustering Algorithm Based on Deep Learning
The trajectory data of aircraft, ships, and so on, can be analyzed to obtain valuable information. Clustering is the basic technology of trajectory analysis, and the feature extraction process is one of the decisive factors for clustering performance. Trajectory features can be divided into two categories: spatial features and temporal features. In mainstream algorithms, spatial features are represented by latitude and longitude coordinates. However, such algorithms are only suitable for trajectories where spatial features are tightly coupled with latitude and longitude. When the same types of trajectories are in different latitude and longitude ranges or there are transformations such as rotation, scaling, and so on, this kind of algorithm is infeasible. Therefore, this paper proposes a spatio-temporal feature trajectory clustering algorithm based on deep learning. In this algorithm, the extraction process of the trajectory spatial shape feature is designed based on image matching technology, and the extracted spatial features are combined with the trajectory temporal features to improve the clustering performance. The experimental results on simulated and real datasets show that the algorithm can effectively extract the trajectory spatial shape features and that the clustering effect of the fused spatio-temporal feature is better than that of a single feature.
- 22 July 2022
- Published by MDPI AG in Electronics
- Vol. 11 (15) , 2283
Open AccessA Spatio-Temporal Feature Trajectory Clustering Algorithm Based on Deep Learning
The trajectory data of aircraft, ships, and so on, can be analyzed to obtain valuable information. Clustering is the basic technology of trajectory analysis, and the feature extraction process is one of the decisive factors for clustering performance. Trajectory features can be divided into two categories: spatial features and temporal features. In mainstream algorithms, spatial features are represented by latitude and longitude coordinates. However, such algorithms are only suitable for trajectories where spatial features are tightly coupled with latitude and longitude. When the same types of trajectories are in different latitude and longitude ranges or there are transformations such as rotation, scaling, and so on, this kind of algorithm is infeasible. Therefore, this paper proposes a spatio-temporal feature trajectory clustering algorithm based on deep learning. In this algorithm, the extraction process of the trajectory spatial shape feature is designed based on image matching technology, and the extracted spatial features are combined with the trajectory temporal features to improve the clustering performance. The experimental results on simulated and real datasets show that the algorithm can effectively extract the trajectory spatial shape features and that the clustering effect of the fused spatio-temporal feature is better than that of a single feature.
- Open Access
- 21 April 2022
- Published by MDPI AG in Electronics
- Vol. 11 (9) , 1322
The Impact of Partial Balance of Imbalanced Dataset on Classification Performance
The imbalance of network data seriously affects the classification performance of algorithms. Most studies have only used a rough description of data imbalance with less exploration of the specific factors affecting classification performance, which has resulted in difficulty putting forward targeted solutions. In this paper, we find that the impact of medium categories on classification performance cannot be ignored, and therefore propose the concept of partial balance, consisting of Class Number of Partial Balance (β) and Balance Degree of Partial Samples (μ). Combined with Global Slope (α), a parameterized model is established to describe the difference of imbalanced datasets. Experiments are performed on the Moore Dataset and CICIDS 2017 Dataset. The experiment’s results on Random Forest, Decision Tree and Deep Neural Network show increasing α is a conducive step in the performance improvement of minority classes and overall classes. When β of dominant categories increases, that of inferior classes decreases, which results in a decrease in the average performance of minority classes. The lower μ is, the closer the sample size of medium classes is to the minority classes, and the better the average performance is. Based on the conclusions, we propose and verify some basic strategies by various classical algorithms.
- 21 April 2022
- Published by MDPI AG in Electronics
- Vol. 11 (9) , 1322
Open AccessThe Impact of Partial Balance of Imbalanced Dataset on Classification Performance
The imbalance of network data seriously affects the classification performance of algorithms. Most studies have only used a rough description of data imbalance with less exploration of the specific factors affecting classification performance, which has resulted in difficulty putting forward targeted solutions. In this paper, we find that the impact of medium categories on classification performance cannot be ignored, and therefore propose the concept of partial balance, consisting of Class Number of Partial Balance (β) and Balance Degree of Partial Samples (μ). Combined with Global Slope (α), a parameterized model is established to describe the difference of imbalanced datasets. Experiments are performed on the Moore Dataset and CICIDS 2017 Dataset. The experiment’s results on Random Forest, Decision Tree and Deep Neural Network show increasing α is a conducive step in the performance improvement of minority classes and overall classes. When β of dominant categories increases, that of inferior classes decreases, which results in a decrease in the average performance of minority classes. The lower μ is, the closer the sample size of medium classes is to the minority classes, and the better the average performance is. Based on the conclusions, we propose and verify some basic strategies by various classical algorithms.
- Open Access
- 2 April 2019
- Published by MDPI AG in Applied Sciences
- Vol. 9 (7) , 1391
A Low-Complexity Resource Allocation Algorithm for Indoor Visible Light Communication Ultra-Dense Networks
In this paper, a low-complexity multi-cell resource allocation algorithm with a near-optimal system throughput is proposed to resolve the conflict between the high system throughput and low complexity of indoor visible light communication ultra-dense networks (VLC-UDNs). First, by establishing the optimal model of the resource allocation problem in each cell, we concluded that the problem is a convex optimization problem. After this, the analytic formula of the normalized scaling factor of each terminal for resource allocation is derived after reasonable approximate treatment. The resource allocation algorithm is subsequently proposed. Finally, the complexity analysis shows that the proposed algorithm has polynomial complexity, which is lower than the classical optimal inter-point method. The simulation results show that the proposed method achieves a improvement of 57% in performance in terms of the average system throughput and improvement of 67% in performance in terms of the quality of service (QoS) guarantee against the required data rate proportion allocation (RDR-PA) method.
- 2 April 2019
- Published by MDPI AG in Applied Sciences
- Vol. 9 (7) , 1391
Open AccessA Low-Complexity Resource Allocation Algorithm for Indoor Visible Light Communication Ultra-Dense Networks
In this paper, a low-complexity multi-cell resource allocation algorithm with a near-optimal system throughput is proposed to resolve the conflict between the high system throughput and low complexity of indoor visible light communication ultra-dense networks (VLC-UDNs). First, by establishing the optimal model of the resource allocation problem in each cell, we concluded that the problem is a convex optimization problem. After this, the analytic formula of the normalized scaling factor of each terminal for resource allocation is derived after reasonable approximate treatment. The resource allocation algorithm is subsequently proposed. Finally, the complexity analysis shows that the proposed algorithm has polynomial complexity, which is lower than the classical optimal inter-point method. The simulation results show that the proposed method achieves a improvement of 57% in performance in terms of the average system throughput and improvement of 67% in performance in terms of the quality of service (QoS) guarantee against the required data rate proportion allocation (RDR-PA) method.
- Open Access
- 2 March 2019
- Published by MDPI AG in Electronics
- Vol. 8 (3) , 276
Performance Analysis of Bandwidth Allocation Based on Dynamic User Priority for Indoor Visible Light Communication Ultra-Dense Networks
Focusing on the high user density in visible light communication ultra-dense networks (VLC-UDNs), this paper proposes a resource allocation method based on dynamic user priority (DUP). Firstly, this paper establishes the DUP model, which realizes a multi-dimensional measurement for differences of users. Considering the variety of network environments, we dynamically select multiple features of users and achieve the calculation of DUP by fuzzy logic (FL). Secondly, the throughput-maximizing resource allocation (TMRA) scheme with user priority guarantee is proposed. Thirdly, the lower bound of the proposed DUP-TMRA is derived. Simulation results show that the proposed multi-dimensional DUP model outperforms the conventional one-dimensional DUP model and fixed priority model. In addition, the proposed TMRA scheme outperforms the conventional proportion allocation scheme. Finally, in comparisons of system throughput, the proposed DUP-TMRA achieves 4% performance improvement against the conventional required data rate proportion allocation (RPA) method. In comparisons of fairness, DUP achieves the modest performance. In comparisons of satisfaction, when the average blocking probability is higher than 0.45, the proposed DUP-TMRA improves the proportion of satisfied users against the conventional RPA method by up to 17.5%.
- 2 March 2019
- Published by MDPI AG in Electronics
- Vol. 8 (3) , 276
Open AccessPerformance Analysis of Bandwidth Allocation Based on Dynamic User Priority for Indoor Visible Light Communication Ultra-Dense Networks
Focusing on the high user density in visible light communication ultra-dense networks (VLC-UDNs), this paper proposes a resource allocation method based on dynamic user priority (DUP). Firstly, this paper establishes the DUP model, which realizes a multi-dimensional measurement for differences of users. Considering the variety of network environments, we dynamically select multiple features of users and achieve the calculation of DUP by fuzzy logic (FL). Secondly, the throughput-maximizing resource allocation (TMRA) scheme with user priority guarantee is proposed. Thirdly, the lower bound of the proposed DUP-TMRA is derived. Simulation results show that the proposed multi-dimensional DUP model outperforms the conventional one-dimensional DUP model and fixed priority model. In addition, the proposed TMRA scheme outperforms the conventional proportion allocation scheme. Finally, in comparisons of system throughput, the proposed DUP-TMRA achieves 4% performance improvement against the conventional required data rate proportion allocation (RPA) method. In comparisons of fairness, DUP achieves the modest performance. In comparisons of satisfaction, when the average blocking probability is higher than 0.45, the proposed DUP-TMRA improves the proportion of satisfied users against the conventional RPA method by up to 17.5%.
- Open Access
- 25 July 2018
- Published by MDPI AG in Applied Sciences
- Vol. 8 (8) , 1219
Power Allocation of Non-Orthogonal Multiple Access Based on Dynamic User Priority for Indoor QoS-Guaranteed Visible Light Communication Networks
Non-orthogonal multiple access (NOMA) simultaneously provides multi-user access over the same frequency band or time period, which can significantly improve system throughput in visible light communication (VLC) networks. However, the different interference components of NOMA and the diversified user requirements in VLC are difficult to coordinate. To guarantee both throughput enhancement and quality of service (QoS) satisfaction, this paper presents a power allocation scheme based on dynamic user priority in indoor NOMA-VLC networks. We introduce fuzzy logic (FL) to flexibly analyse user priority and assign signal power using multi-dimensional user features. The experimental results show that our method achieves the best performance in terms of user fairness and satisfaction. In indoor VLC, which has small cells with a high user density, our method outperforms contrastive schemes in terms of the average user data rate (AUDR). Therefore, in comparisons between static and dynamic user priority, our study indicates the fairness advantages of FL for the dynamic evaluation of user priority. In comparisons between NOMA and orthogonal multiple access, our study reflects the AUDR advantages of non-orthogonal methods. Furthermore, in comparisons of user satisfaction, our method outperforms existing methods, indicating the achievement of the QoS guarantee.
- 25 July 2018
- Published by MDPI AG in Applied Sciences
- Vol. 8 (8) , 1219
Open AccessPower Allocation of Non-Orthogonal Multiple Access Based on Dynamic User Priority for Indoor QoS-Guaranteed Visible Light Communication Networks
Non-orthogonal multiple access (NOMA) simultaneously provides multi-user access over the same frequency band or time period, which can significantly improve system throughput in visible light communication (VLC) networks. However, the different interference components of NOMA and the diversified user requirements in VLC are difficult to coordinate. To guarantee both throughput enhancement and quality of service (QoS) satisfaction, this paper presents a power allocation scheme based on dynamic user priority in indoor NOMA-VLC networks. We introduce fuzzy logic (FL) to flexibly analyse user priority and assign signal power using multi-dimensional user features. The experimental results show that our method achieves the best performance in terms of user fairness and satisfaction. In indoor VLC, which has small cells with a high user density, our method outperforms contrastive schemes in terms of the average user data rate (AUDR). Therefore, in comparisons between static and dynamic user priority, our study indicates the fairness advantages of FL for the dynamic evaluation of user priority. In comparisons between NOMA and orthogonal multiple access, our study reflects the AUDR advantages of non-orthogonal methods. Furthermore, in comparisons of user satisfaction, our method outperforms existing methods, indicating the achievement of the QoS guarantee.