Abstract
There is a dearth of literature regarding prognostic and predictive factors for outcome following pediatric decompressive craniectomy (DC) following traumatic brain injury (TBI). The aim of this study was to develop a random forest machine learning algorithm to predict outcomes following DC in pediatrics. This is a multi-institutional retrospective study assessing the 6-month postoperative outcome in pediatric patients that underwent DC. We developed a machine learning model using classification and survival random forest algorithms (CRF and SRF respectively) for the prediction of outcomes. Data was collected on clinical signs, radiographic studies, and laboratory studies. The outcome measures for the CRF were mortality and good or bad outcome based on Glasgow Outcome Scale (GOS) at 6-months. A GOS score of 4 or higher indicated a good outcome. The outcomes for the SRF model assessed mortality at during the follow-up period. A total of 40 pediatric patients were included. There was a hospital mortality rate of 27.5%, and 75.8% of survivors had a good outcome at 6-month follow up. The CRF for 6-month mortality had a ROC AUC of 0.984; whereas, the 6-month good/bad outcome had a ROC AUC of 0.873. The SRF was trained at the 6-month timepoint with a ROC AUC of 0.921. CRF and SRF models successfully predicted 6-month outcomes and mortality following DC in pediatric TBI patients. These results suggest random forest models may be efficacious for predicting outcome in this patient population.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.