Myocardial Function Prediction After Coronary Artery Bypass Grafting Using MRI Radiomic Features and Machine Learning Algorithms
Bibliographic record
Abstract
Abstract The main aim of the present study was to predict myocardial function improvement in cardiac MR (LGE-CMR) images in patients after coronary artery bypass grafting (CABG) using radiomics and machine learning algorithms. Altogether, 43 patients who had visible scars on short-axis LGE-CMR images and were candidates for CABG surgery were selected and enrolled in this study. MR imaging was performed preoperatively using a 1.5-T MRI scanner. All images were segmented by two expert radiologists (in consensus). Prior to extraction of radiomics features, all MR images were resampled to an isotropic voxel size of 1.8 × 1.8 × 1.8 mm 3 . Subsequently, intensities were quantized to 64 discretized gray levels and a total of 93 features were extracted. The applied algorithms included a smoothly clipped absolute deviation (SCAD)–penalized support vector machine (SVM) and the recursive partitioning (RP) algorithm as a robust classifier for binary classification in this high-dimensional and non-sparse data. All models were validated with repeated fivefold cross-validation and 10,000 bootstrapping resamples. Ten and seven features were selected with SCAD-penalized SVM and RP algorithm, respectively, for CABG responder/non-responder classification. Considering univariate analysis, the GLSZM gray-level non-uniformity-normalized feature achieved the best performance (AUC: 0.62, 95% CI: 0.53–0.76) with SCAD-penalized SVM. Regarding multivariable modeling, SCAD-penalized SVM obtained an AUC of 0.784 (95% CI: 0.64–0.92), whereas the RP algorithm achieved an AUC of 0.654 (95% CI: 0.50–0.82). In conclusion, different radiomics texture features alone or combined in multivariate analysis using machine learning algorithms provide prognostic information regarding myocardial function in patients after CABG.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".