ArticleJHLT open2026
The utility of machine learning for predicting donor non-use in lung transplantation.
Article in JHLT open, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
12 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Background: Efforts to reduce waitlist mortality in lung transplantation have been hindered by a high donor lung non-use rate, with approximately one-fifth of deceased organ donors ultimately providing lungs for transplantation. Rationale for organ decline varies across individual providers and transplant centers. Greater donor lung utilization could significantly reduce waitlist mortality and improve clinical outcomes for adult lung transplant candidates. Objective: This study aimed to evaluate whether machine learning models can successfully predict donor lung non-use and characterize donor factors associated with current utilization patterns, with the long-term goal of informing more consistent and data-driven donor lung evaluation. Methods: Using U.S. national registry data collected between 2012 and 2022, we generated five machine learning models - logistic regression, decision tree, random forest, XGBoost, and Naive Bayes - all of which were trained with 19 donor variables to predict donor lung non-use. Models were tested with both full donor feature sets and restricted donor feature sets comprised of the top 15, 10, and 5 predictors. Performance metrics, including area under the receiver operating characteristic curve (AUROC), accuracy, precision, recall, and F1 score, were assessed using cross-validation. Results: The random forest model incorporating the full feature set achieved the highest performance with an AUROC of 0.960 (95% CI 0.958-0.961) and an F1 score of 0.9489. However, the logistic regression (AUROC 0.886, 95% CI 0.883-0.888) and XGBoost (AUROC 0.906, 95% CI 0.902-0.908) models also demonstrated robust performance. A restricted random forest model that included only the top 15 predictors demonstrated similar efficacy (AUROC 0.956, 95% CI 0.954-0.958). Key predictors included PaO Conclusion: Machine learning models, particularly random forest, XGBoost, and logistic regression, accurately predicted donor lung non-use. Restricted models using fewer predictors also maintained strong performance, demonstrating technical feasibility for future evaluation in time-sensitive workflows. Because the models were trained on historical utilization decisions rather than recipient outcomes or independent measures of donor suitability, prospective validation is needed to determine whether they can improve appropriate donor lung utilization or support acceptance decisions without reinforcing practice-pattern bias.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.