A modified real AdaBoost algorithm to discover intensive care unit subgroups with a poor outcome
Related Experiment Video
Updated: May 2, 2026

A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment
Published on: January 11, 2020
Antonie Koetsier1, Nicolette F de Keizer1, Ameen Abu-Hanna1
1Academic Medical Center, Amsterdam, the Netherlands.
Abstract:
The Intensive Care Unit (ICU) population is heterogeneous. At individual ICUs, the quality of care may vary within subgroups. We investigate whether poor outcomes of an ICU can be traced back to excess deaths in specific patient subgroups, by discovering candidate subgroups, with a modified adaptive decision tree boosting algorithm applied to 80 Dutch ICUs. Genuine subgroups were selected from candidate subgroups when the case-mix adjusted outcomes were poorer than those of the five top performing ICUs. For 59 ICUs we discovered 122 genuine subgroups and most were defined by one to four variables, with a median of three [2-4]. Variables Glasgow Coma Scale and age were used most. There were 29 ICUs with overall poor outcomes, and for 22 our algorithm found all excess deaths. A new method based on adaptive decision tree boosting discovered many subgroups of ICU patients for which there is potentially room for outcomes improvement.
Related Concept Videos
Comparing the Survival Analysis of Two or More Groups
Classification of Illness
An illness is a response to a disease in which the person's level of functioning is changed compared with a previous level. The general classification of illness includes acute and chronic.
Acute illness is severe...
Cancer Survival Analysis
Quantifying and Rejecting Outliers: The Grubbs Test
