A novel sparse linear mixed model for multi-source mixed-frequency data fusion in telemedicine
Bibliographic record
Abstract
Digital health and telemonitoring have resulted in a wealth of information to be collected to monitor, manage, and improve human health. The multi-source mixed-frequency health data overwhelm the modeling capacity of existing statistical and machine learning models, due to many challenging properties. Although predictive analytics for big health data plays an important role in telemonitoring, there is a lack of rigorous prediction model that can automatically predicts patients' health conditions, e.g., Disease Severity Indicators (DSIs), from multi-source mixed-frequency data. Sleep disorder is a prevalent cardiac syndrome that is characterized by abnormal respiratory patterns during sleep. Although wearable devices are available to administrate sleep studies at home, the manual scoring process to generate the DSI remains a bottleneck in automated monitoring and diagnosis of sleep disorder. To address the multi-fold challenges for precise prediction of the DSI from high-dimensional multi-source mixed-frequency data in sleep disorder, we propose a sparse linear mixed model that combines the modified Cholesky decomposition with group lasso penalties to enable joint group selection of fixed effects and random effects. A novel Expectation Maximization (EM) algorithm integrated with an efficient Majorization Maximization (MM) algorithm is developed for model estimation of the proposed sparse linear mixed model with group variable selection. The proposed method was applied to the SHHS data for telemonitoring and diagnosis of sleep disorder and found that a few significant feature groups that are consistent with prior medical studies on sleep disorder. The proposed method also outperformed a few benchmark methods with the highest prediction accuracy.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".