Epileptic seizure detection on EEG signals using machine learning techniques and advanced preprocessing methods
Bibliographic record
Abstract
Electroencephalography (EEG) is a common tool used for the detection of epileptic seizures. However, the visual analysis of long-term EEG recordings is characterized by its subjectivity, time-consuming procedure and its erroneous detection. Various epileptic seizure detection algorithms have been proposed to deal with such issues. In this study, a novel automatic seizure-detection approach is proposed. Three different strategies are suggested to the user whereby he/she could choose the appropriate one for a given classification problem. Indeed, the feature extraction step, including both linear and nonlinear measures, is performed either directly from the EEG signals, or from the derived sub-bands of tunable-Q wavelet transform (TQWT), or even from the intrinsic mode functions (IMFs) of multivariate empirical mode decomposition (MEMD). The classification procedure is executed using a support vector machine (SVM). The performance of the proposed method is evaluated through a publicly available database from which six binary classification cases are formulated to discriminate between healthy, seizure and non-seizure EEG signals. Our results show high performance in terms of accuracy (ACC), sensitivity (SEN) and specificity (SPE) compared to the state-of-the-art approaches. Thus, the proposed approach for automatic seizure detection can be considered as a valuable alternative to existing methods, able to alleviate the overload of visual analysis and accelerate the seizure detection.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 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.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".