MediBoost: a Patient Stratification Tool for Interpretable Decision Making in the Era of Precision Medicine
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Machine learning algorithms that are both interpretable and accurate are essential in applications such as medicine where errors can have a dire consequence. Unfortunately, there is currently a tradeoff between accuracy and interpretability among state-of-the-art methods. Decision trees are interpretable and are therefore used extensively throughout medicine for stratifying patients. Current decision tree algorithms, however, are consistently outperformed in accuracy by other, less-interpretable machine learning models, such as ensemble methods. We present MediBoost, a novel framework for constructing decision trees that retain interpretability while having accuracy similar to ensemble methods, and compare MediBoost’s performance to that of conventional decision trees and ensemble methods on 13 medical classification problems. MediBoost significantly outperformed current decision tree algorithms in 11 out of 13 problems, giving accuracy comparable to ensemble methods. The resulting trees are of the same type as decision trees used throughout clinical practice but have the advantage of improved accuracy. Our algorithm thus gives the best of both worlds: it grows a single, highly interpretable tree that has the high accuracy of ensemble methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Machine learning: Trends, perspectives, and prospects
Jordan, M. I., & Mitchell, T. M. (2015) · Science · doi:10.1126/science.aaa8415 · Cited by 9,955
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884 · cited 1×
“Similar to AdaBoost, MAB, can be obtained by minimizing an exponential loss function using additive logistic regression 22 with the addition of a membership function that describes the degree of belonging of a certain observation to a given node.”
MethodA Randomized Trial of Bevacizumab for Newly Diagnosed Glioblastoma
Gilbert, M. R., Dignam, J. J., Armstrong, T. S., Wefel, J. S., Blumenthal, D. T., Vogelbaum, M. A., Colman, H., Chakravarti, A., Pugh, S., Won, M., et al. (2014) · New England Journal of Medicine · doi:10.1056/nejmoa1308573 · Cited by 2,834
An empirical comparison of supervised learning algorithms
Caruana, R., & Niculescu-Mizil, A. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143865 · Cited by 2,780 · cited 4×
“Although we present MediBoost algorithms with only two branches per node in this paper (stumps) for simplicity, it could easily be extended to multi-branch nodes, where each node will represent a tree similar to those used in boosted trees with the corresponding improvement in accuracy as shown by Caruana et al. 30 .”
BackgroundMethodResultInfluentialCosmides, L. (1996) · Cognition · doi:10.1016/0010-0277(95)00664-8 · Cited by 1,293
Letham, B., Rudin, C., McCormick, T. H., & Madigan, D. (2015) · The Annals of Applied Statistics · doi:10.1214/15-aoas848 · Cited by 766
Cited by
Ahmed, Z., Mohamed, K., Zeeshan, S., & Dong, X. (2020) · Database · doi:10.1093/database/baaa010 · Cited by 1,035
Yang, G., Ye, Q., & Xia, J. (2022) · Information Fusion · doi:10.1016/j.inffus.2021.07.016 · Cited by 717
“5 shows, decision tree based methods are normally interpretable, research studies have been done using automated pruning of decision trees for various classifications of illnesses [132] and accurate decision trees focused on boosting patient stratification [133].”
MethodArtificial intelligence and machine learning for medical imaging: A technology review
Barragán-Montero, A., Javaid, U., Valdés, G., Nguyen, D., Desbordes, P., Macq, B., Willems, S., Vandewinckele, L., Holmström, M., Löfman, F., et al. (2021) · Physica Medica · doi:10.1016/j.ejmp.2021.04.016 · Cited by 450
RETRACTED ARTICLE: Artificial intelligence and machine learning in precision and genomic medicine
Quazi, S. (2022) · Medical Oncology · doi:10.1007/s12032-022-01711-1 · Cited by 432
RetractedFrom hype to reality: data science enabling personalized medicine
Fröhlich, H., Balling, R., Beerenwinkel, N., Kohlbacher, O., Kumar, S., Lengauer, T., Maathuis, M. H., Moreau, Y., Murphy, S. A., Przytycka, T. M., et al. (2018) · BMC Medicine · doi:10.1186/s12916-018-1122-7 · Cited by 414
Machine learning for enterprises: Applications, algorithm selection, and challenges
Lee, I., & Shin, Y. J. (2020) · Business Horizons · doi:10.1016/j.bushor.2019.10.005 · Cited by 389
Payrovnaziri, S. N., Chen, Z., Rengifo-Moreno, P., Miller, T., Bian, J., Chen, J. H., Liu, X., & He, Z. (2020) · Journal of the American Medical Informatics Association · doi:10.1093/jamia/ocaa053 · Cited by 313
Deist, T. M., Dankers, F. J. W. M., Valdes, G., Wijsman, R., Hsu, I., Oberije, C., Lustberg, T., van Soest, J., Hoebers, F., Jochems, A., et al. (2018) · Medical Physics · doi:10.1002/mp.12967 · Cited by 304
Self-citationNasarian, E., Alizadehsani, R., Acharya, U. R., & Tsui, K.-L. (2024) · Information Fusion · doi:10.1016/j.inffus.2024.102412 · Cited by 207
Learning Optimal and Fair Decision Trees for Non-Discriminative Decision-Making
Aghaei, S., Azizi, M. J., & Vayanos, P. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33011418 · Cited by 135
Interpretable Anomaly Detection with DIFFI: Depth-based feature importance of Isolation Forest
Carletti, M., Terzi, M., & Susto, G. A. (2023) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105730 · Cited by 118
Condran, S., Bewong, M., Islam, M. Z., Maphosa, L., & Zheng, L. (2022) · IEEE Access · doi:10.1109/access.2022.3188649 · Cited by 99
Development of a novel prognostic model to predict 6-month swallowing recovery after ischemic stroke
Lee, W. H., Lim, M. H., Seo, H. G., Seong, M. Y., Oh, B.-M., & Kim, S. (2020) · Stroke · doi:10.1161/strokeaha.119.027439 · Cited by 72
A Roadmap towards Precision Periodontics
Rakic, M., Pejcic, N., Perunovic, N., & Vojvodic, D. (2021) · Medicina · doi:10.3390/medicina57030233 · Cited by 36
“Machine learning algorithms have the capacity to cross-analyze unlimited numbers of clinical and biological parameters while identifying a panel of critical determinants within highly specific patterns, which are further integrated into accurate and interpretable diagnostic information [25].”
BackgroundRieg, T., Frick, J., Baumgartl, H., & Buettner, R. (2020) · PLOS ONE · doi:10.1371/journal.pone.0243615 · Cited by 34
Giang, T.-T., Nguyen, T.-P., & Tran, D.-H. (2020) · BMC Medical Informatics and Decision Making · doi:10.1186/s12911-020-01140-y · Cited by 26
Explainable AI applications in the Medical Domain: a systematic review
Prentzas, N., Kakas, A., & Pattichis, C. S. (2023) · arXiv · doi:10.48550/arxiv.2308.05411 · Cited by 19
Metadata
- Authors
- Valdes, G., Luna, J. M., Eaton, E., Simone, C. B., Ungar, L. H., & Solberg, T. D.
- Venue
- Scientific Reports
- Published
- 2016-11-30
- Volume
- 6
- Issue
- 1
- Pages
- 37854-37854
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W2558685994
- Cited by
- 118
- References
- 7
- FWCI
- 12.45
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.