Channel Selection Improves Accuracy for Pediatric Users of Motor Imagery Brain-Computer Interfaces
Bibliographic record
Abstract
Children are an under-served population in the field of brain-computer interface (BCI) development. The high prevalence of lifelong disability coupled with the diversity and plasticity of children's brains make them ideal candidates for personalized BCI systems. Channel selection methods provide a tool for the in-session personalization of BCI systems. To evaluate the efficacy of channel selection for pediatric users, we tested four wrapper-based channel selection algorithms, sequential forward selection (SFS), sequential backward selection (SBS), sequential forward floating selection (SFFS), and sequential backward floating selection (SBFS) on offline motor imagery BCI data from three datasets involving typically developing children. The purpose was to assess the performance benefits and computational costs of each algorithm. All algorithms provided classification accuracy gains of 10–15 % with their optimal subsets. The time required to reach the optimal subsets varied between algorithms, but all took less than 80 s with mean completion times of 9.5 s and 35.8 s for the fastest (SFS) and slowest (SFFS), respectively. Adjusting the stopping criterion of the algorithm enables users to further reduce computation time with a disproportionately small effect on classification accuracy. All methods demonstrated an ability to prioritize expected physiological regions of interest and leave out channels detrimental to the classifier. Channel selection offers personalization of the BCI system for a specific user and a specific classifier. These findings emphasize the value of using personalized channel selection algorithms to improve motor imagery BCI systems for pediatric users.
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.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".