Loading…
Wireless Communication Channel Scenarios: Machine-Learning-Based Identification and Performance Enhancement
Wireless communication channel scenario classification is crucial for new modern wireless technologies. Reducing the time consumed by the data preprocessing phase for such identification is also essential, especially for multiple-scenario transitions in 6G. Machine learning (ML) has been used for sc...
Saved in:
Published in: | Electronics (Basel) 2022-10, Vol.11 (19), p.3253 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Wireless communication channel scenario classification is crucial for new modern wireless technologies. Reducing the time consumed by the data preprocessing phase for such identification is also essential, especially for multiple-scenario transitions in 6G. Machine learning (ML) has been used for scenario identification tasks. In this paper, the least absolute shrinkage and selection operator (LASSO) is used instead of ElasticNet in order to reduce the computational time of data preprocessing for ML. Moreover, the computational time and performance of different ML models are evaluated based on a regularization technique. The obtained results reveal that the LASSO operator achieves the same feature selection performance as ElasticNet; however, the LASSO operator consumes less computational time. The achieved run time of LASSO is 0.33 s, while the ElasticNet corresponding value is 0.67 s. The identification for each specific class for K-Nearest Neighbor (KNN), Support Vector Machine (SVM), and k-Means and Gaussian Mixture Model (GMM) is evaluated using Receiver Operating Characteristics (ROC) curves and Area Under the Curve (AUC) scores. The KNN algorithm has the highest class-average AUC score at 0.998, compared to SVM, k-Means, and GMM with values of 0.994, 0.983, and 0.989, respectively. The GMM is the fastest algorithm among others, having the lowest classification time at 0.087 s, compared to SVM, k-Means, and GMM with values of 0.155, 0.26, and 0.087, respectively. |
---|---|
ISSN: | 2079-9292 2079-9292 |
DOI: | 10.3390/electronics11193253 |