A deep neural network classifier for P300 BCI speller based on Cohen’s class time-frequency distribution
Bibliographic record
Abstract
This paper presents a new method of predicting the P300 component of an electroencephalography (EEG)signal to recognize the characters in a P300 brain-computer interface (BCI) speller accurately. This method consistsof a deep learning model and the nonlinear time-frequency features. It is believed that the combination of the deepmodel network and extracting the nonlinear features of the EEG led this research to a better prediction of the P300and, therefore, character recognition. Cohen's class distribution is used in order to extract the nonlinear features of theEEG. Evaluating all of the kernels, Butterworth found to be more informative and it produced better results. Basedon the differences observed between time-frequency responses of target and nontarget signals, specific subbands areselected to extract seven features. A deep-structured neural network, namely stacked sparse autoencoders, is appliedfor BCI character recognition. This deep network reduces the dimension of feature space by extracting unsupervisedfeatures. Then, the features are fed to a Softmax classifier. Afterward, the whole network passes a fine-tuning phase by asupervised backpropagation algorithm. For evaluating the work, Dataset II of BCI Competition III is utilized. Based onthe results, this approach would improve the accuracy in both P300 detection and character recognition. This researchresults in 82.7% and 93.5% accuracy for P300 classification and character recognition, respectively.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".