A Machine-Learned Comorbidity Index
Quick Answer
This paper shows that The Machine-Learned Comorbidity Index (MLCI) improves upon traditional comorbidity scores by capturing nonlinear risk-outcome relationships, outperforming established benchmarks in electronic health record datasets.
Quick Take
The Machine-Learned Comorbidity Index (MLCI) improves upon traditional comorbidity scores by capturing nonlinear risk-outcome relationships, outperforming established benchmarks in electronic health record datasets. MLCI maximizes the normalized Hilbert-Schmidt Independence Criterion (nHSIC) for better patient stratification across multiple clinical outcomes.
Key Points
- MLCI addresses limitations of traditional scores like Charlson and Elixhauser.
- It captures nonlinear relationships between comorbidities and clinical outcomes.
- Empirical tests show MLCI outperforms strong baseline models in EHR datasets.
- The model is grounded in a theoretical framework for unified patient ordering.
- MLCI enhances risk adjustment and patient stratification in healthcare.
Paper Resources
Article Excerpt
From source RSS / original summaryarXiv:2606. 17450v1 Announce Type: new Abstract: Traditional comorbidity scores (e. g. , Charlson and Elixhauser) are widely used for risk adjustment and patient stratification, but they have two key limitations: (i) they are largely mortality-centric and do not align well with other clinical outcomes, and (ii) their linear, rule-based structure cannot capture nonlinear, outcome-specific risk relationships.
We propose a Machine-Learned Comorbidity Index (MLCI) that maps diagnosis codes to a single scalar by maximizing the normalized Hilbert-Schmidt Independence Criterion (nHSIC) between the learned score and multiple clinical outcomes. MLCI captures nonlinear risk-outcome dependence and is supported by a theory that characterizes when a unified, informative admission-level ordering can be achieved across outcomes.
Empirical results on multiple benchmark electronic health record (EHR) datasets show that MLCI outperforms strong baselines across multiple evaluation metrics.
Reader Mode unavailable (could not extract clean content).
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from arXiv cs.AI
See more →Arbor: Tree Search as a Cognition Layer for Autonomous Agents
Arbor introduces a multi-agent framework utilizing structured tree search for optimizing LLM inference, achieving up to 193% throughput-latency improvement compared to vendor-optimized systems. It employs an Orchestrator and Critic agent for stability and coordination, demonstrating hardware-agnostic performance with minimal variance.