Enhancing detection of epileptic seizures using transfer learning and EEG brain activity signals
Bibliographic record
Abstract
Epileptic seizures are neurological events characterized by sudden and excessive electrical discharges in the brain, leading to disruptions in brain function. Epileptic seizures can lead to life-threatening situations such as status epilepticus, which is characterized by prolonged or recurrent seizures and may lead to respiratory distress, aspiration pneumonia, and cardiac arrhythmias. Therefore, there is a need for an automated approach that can efficiently diagnose epileptic seizures at an early stage. The primary objective of this study is to develop a highly accurate approach for the early diagnosis of epileptic seizures. We use electroencephalography (EEG) signal data based on different brain activities to conduct experiments for epileptic seizure detection. For this purpose, a novel transfer learning technique called random forest-gated recurrent unit (RFGR) is proposed. The EEG brain activity signal data is fed into the RFGR model to generate a new feature set. The newly generated features are based on the class prediction probabilities extracted by the RFGR and are utilized to train models. Extensive experiments are carried out to investigate the performance of the proposed approach. Results demonstrate that the RFGR, when used with the random forest model, outperforms state-of-the-art techniques, achieving a high accuracy of 99.00 %. Additionally, explainable artificial intelligence analysis is utilized to provide transparent and understandable explanations of the decision-making processes of the proposed approach.
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.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.001 | 0.000 |
| 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".