Soft Computing-Based EEG Classification by Optimal Feature Selection and Neural Networks
Bibliographic record
Abstract
Brain computer interface translates electroencephalogram (EEG) signals into control commands so that paralyzed people can control assistive devices. This human thought translation is a very challenging process as EEG signals contain noise. For noise removal, a bandpass filter or a filter bank is used. However, these techniques also remove useful information from the signal. Furthermore, after feature extraction, there are such features which do not play any significant role in effective classification. Thus, soft computing-based EEG classification followed by extraction and then selection of optimal features can produce better results. In this paper, subband common spatial patterns using sequential backward floating selection is being proposed in order to classify motor-imagery-based EEG signals. The signal is decomposed into subband using a filter bank having overlapped frequency cutoffs. Linear discriminant analysis followed by common spatial pattern is applied to the output of each filter for features extraction. Then, sequential backward floating selection is applied for selection of optimal features to train radial basis function neural networks. Two different datasets have been used for evaluation of results, i.e., Open BCI dataset and EEG signals acquired by Emotiv Epoc. The proposed system shows an overall accuracy of 93.05% and 85.00% for both datasets, respectively. The results show that the proposed optimal feature selection and neural network-based classification approach with overlapped frequency bands is an effective method for EEG classification as compared to previous techniques.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".