Development of a machine learning model for predicting renal damage in children with closed spinal dysraphism
Yu He, Wan-liang Guo, Ming-chang Zhang
BMC Pediatrics · 2025
doi:10.1186/s12887-025-05936-7 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Abstract Background Renal damage in closed spinal dysraphism (CSD), primarily linked to neurogenic bladder dysfunction, significantly impacts long-term patient outcomes by increasing the risk of chronic kidney disease. Identifying patients at highest risk for renal damage is essential for implementing early interventions, improving bladder management strategies, and preserving renal function. This study aims to develop an effective machine learning model to predict renal damage in children with CSD. Methods This retrospective study included 110 children with CSD. We developed four machine learning models (logistic regression, support vector machine, decision tree, and extreme gradient boosting [XGBoost]), and compared their predictive performances. The area under the receiver operating characteristic curve (AUC), calibration curve, and decision curve analysis were used to evaluate predictive performance. The Shapley additive explanations (SHAP) algorithm and Local Interpretable Model-Agnostic Explanations (LIME) were used to interpret the optimal model. Results The XGBoost model showed the best predictive performance (AUC = 0.957) among the four machine learning models. Through the SHAP analysis, abnormal radiological lower urinary tract findings, female sex, and high-grade vesicoureteral reflux were identified as the three most influential features in predicting renal damage. Conclusion Our study effectively developed a model that accurately predicted renal damage in children with CSD based on the XGBoost algorithm, demonstrating its potential to achieve good predictive performance.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.