Online Seizure Prediction System: A Novel Probabilistic Approach for Efficient Prediction of Epileptic Seizure with iEEG Signal
Bibliographic record
Abstract
Background: 1% of people around the world are suffering from epilepsy. It is, therefore crucial to propose an efficient automated seizure prediction tool implemented in a portable device that uses the electroencephalogram (EEG) signal to enhance epileptic patients’ life quality. Methods: In this study, we focused on time-domain features to achieve discriminative information at a low CPU cost extracted from the intracranial electroencephalogram (iEEG) signals of six patients. The probabilistic framework based on XGBoost classifier requires the mean and maximum probability of the non-seizure and the seizure occurrence period segments. Once all these parameters are set for each patient, the medical decision maker can send alarm based on well-defined thresholds. Results: While finding a unique model for all patients is really challenging, and our modelling results demonstrated that the proposed algorithm can be an efficient tool for reliable and clinically relevant seizure forecasting. Using iEEG signals, the proposed algorithm can forecast seizures, informing a patient about 75 minutes before a seizure would occur, a period large enough for patients to take practical actions to minimize the potential impacts of the seizure. Conclusion: We posit that the ability to distinguish interictal intracranial EEG from pre-ictal signals at some low computational cost may be the first step towards an implanted portable semi-automatic seizure suppression system in the near future. It is believed that our seizure prediction technique can conceivably be coupled with treatment techniques aimed at interrupting the process even prior to a seizure initiates to develop.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".