EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Investigating Feature Selection Techniques to Enhance the Performance of EEG-Based Motor Imagery Tasks Classification

Md. Humaun Kabir, Shabbir Mahmood, Abdullah Al Shiam, Abu Saleh Musa Miah, Jungpil Shin, Md. Khademul Islam Molla

Mathematics · 19.04.2023 · 11 (8) · 1921

DOI: 10.3390/math11081921 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 19.04.2023. Verfasst von Md. Humaun Kabir und 5 weiteren Autor:innen. Die Arbeit wurde bisher 54-mal zitiert (Crossref) und nennt 62 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Competitive Research Fund of The University of Aizu, Japan.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Analyzing electroencephalography (EEG) signals with machine learning approaches has become an attractive research domain for linking the brain to the outside world to establish communication in the name of the Brain-Computer Interface (BCI). Many researchers have been working on developing successful motor imagery (MI)-based BCI systems. However, they still face challenges in producing better performance with them because of the irrelevant features and high computational complexity. Selecting discriminative and relevant features to overcome the existing issues is crucial. In our proposed work, different feature selection algorithms have been studied to reduce the dimension of multiband feature space to improve MI task classification performance. In the procedure, we first decomposed the MI-based EEG signal into four sets of the narrowband signal. Then a common spatial pattern (CSP) approach was employed for each narrowband to extract and combine effective features, producing a high-dimensional feature vector. Three feature selection approaches, named correlation-based feature selection (CFS), minimum redundancy and maximum relevance (mRMR), and multi-subspace randomization and collaboration-based unsupervised feature selection (SRCFS), were used in this study to select the relevant and effective features for improving classification accuracy. Among them, the SRCFS feature selection approach demonstrated outstanding performance for MI classification compared to other schemes. The SRCFS is based on the multiple k-nearest neighbour graphs method for learning feature weight based on the Laplacian score and then discarding the irrelevant features based on the weight value, reducing the feature dimension. Finally, the selected features are fed into the support vector machines (SVM), linear discriminative analysis (LDA), and multi-layer perceptron (MLP) for classification. The proposed model is evaluated with two benchmark datasets, namely BCI Competition III dataset IVA and dataset IIIB, which are publicly available and mainly used to recognize the MI tasks. The LDA classifier with the SRCFS feature selection algorithm exhibits better performance. It proves the superiority of our proposed study compared to the other state-of-the-art BCI-based MI task classification systems.

Förderung

  • Competitive Research Fund of The University of Aizu, Japan

Zitieren

APA

Kabir, M. H., Mahmood, S., Shiam, A. A., Miah, A. S. M., Shin, J., & Molla, M. K. I. (2023). Investigating Feature Selection Techniques to Enhance the Performance of EEG-Based Motor Imagery Tasks Classification. Mathematics, 11(8), 1921. https://doi.org/10.3390/math11081921

Vancouver

Kabir MH, Mahmood S, Shiam AA, Miah ASM, Shin J, Molla MKI. Investigating Feature Selection Techniques to Enhance the Performance of EEG-Based Motor Imagery Tasks Classification. Mathematics. 2023;11(8):1921. doi:10.3390/math11081921

BibTeX
@article{Kabir2023,
  author = {Kabir, Md. Humaun and Mahmood, Shabbir and Shiam, Abdullah Al and Miah, Abu Saleh Musa and Shin, Jungpil and Molla, Md. Khademul Islam},
  title = {Investigating Feature Selection Techniques to Enhance the Performance of EEG-Based Motor Imagery Tasks Classification},
  journal = {Mathematics},
  year = {2023},
  volume = {11},
  number = {8},
  pages = {1921},
  doi = {10.3390/math11081921}
}
Kostenlos starten →