Analytical Features Assisted Hierarchical Classification for Automatic Sleep Stage Scoring
Bibliographic record
Abstract
In the area of sleep study, automatic sleep stage identification through Electroencephalogram (EEG) is an important step.However, the outcomes obtained with modern, cutting-edge techniques are not satisfactory; hence, they cannot be used in standard clinical procedures.In the following paper, we suggest a simple yet productive solution with automated sleep staging through analytical features and hierarchical classification.As an initial step, the proposed method segments the input EEG signal into different epochs and describes each epoch with 22 features extracted from multiple domains, including frequency-domain, time-frequency-domain, time-domain, and non-linear domain.The ability of analytical features to perfectly differentiate between sleep stages with similar characteristics demonstrates their efficacy.Further, this work introduces a new classification scheme called hierarchical classification, which solves the complex classification problem by breaking it into small problems.At classification, we employed the binary Support Vector Machine (SVM).In terms of performance, the proposed system is validated through a standard and publicly available Sleep-EDF dataset.In comparison with gold-standard manual scoring, we achieved 92.3500% accuracy and a 0.8646 kappa coefficient with our method.Further, the suggested method outperformed current cutting-edge automatic sleep stage classification techniques in terms of better results.
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.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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".