Derivative Method to Detect Sleep and Awake States through Heart Rate Variability Analysis Using Machine Learning Algorithms
Bibliographic record
Abstract
Sleep disorders can have harmful consequences in both the short and long term. They can lead to attention deficits, as well as cardiac, neurological and behavioral repercussions. One of the most widely used methods for assessing sleep disorders is polysomnography (PSG). A major challenge associated with this method is all the cables needed to connect the recording devices, making the examination more intrusive and usually requiring a clinical environment. This can have potential consequences on the test results and their accuracy. One simple way to assess the state of the central nervous system (CNS), a well-known indicator of sleep disorder, could be the use of a portable medical device. With this in mind, we implemented a simple model using both the RR interval (RRI) and its second derivative to accurately predict the awake and napping states of a subject using a feature classification model. For training and validation, we used a database providing measurements from nine healthy young adults (six men and three women), in which heart rate variability (HRV) associated with light-on, light-off, sleep onset and sleep offset events. Results show that using a 30 min RRI time series window suffices for this lightweight model to accurately predict whether the patient was awake or napping.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".