Evidence map›Paper›PMID 38635591›Full record

ArticlePloS one2024

Confirming the statistically significant superiority of tree-based machine learning algorithms over their counterparts for tabular data.

Shahadat Uddin, Haohui Lu

Abstract read
In one paragraph

Article in PloS one, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 24 papers, 3 of them syntheses that pooled it.

0numbers the graph read from it
0cells of the map it votes in
24citing papers in PubMed, 3 pooled it
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

24 citing papers in PubMed, 3 syntheses or guidelines pooled it.

  1. Pooled it
  2. Pooled it
  3. Pooled it
  4. Article
  5. Review
  6. Article
  7. Article
  8. Article
  9. Visual interpretation of [European journal of nuclear medicine and molecular imaging · 2026
    Article
  10. Observational
  11. Large Models for Small Tables: Adapting Tabular Foundation Models to EHR Data.AMIA Joint Summits on Translational Science proceedings. AMIA Joint Summits on Translational Science · 2026
    Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Shahadat UddinSchool of Project Management, Faculty of Engineering, The University of Sydney, Forest Lodge, NSW, Australia.ORCID 0000-0003-0091-6919
Haohui LuSchool of Project Management, Faculty of Engineering, The University of Sydney, Forest Lodge, NSW, Australia.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Many individual studies in the literature observed the superiority of tree-based machine learning (ML) algorithms. However, the current body of literature lacks statistical validation of this superiority. This study addresses this gap by employing five ML algorithms on 200 open-access datasets from a wide range of research contexts to statistically confirm the superiority of tree-based ML algorithms over their counterparts. Specifically, it examines two tree-based ML (Decision tree and Random forest) and three non-tree-based ML (Support vector machine, Logistic regression and k-nearest neighbour) algorithms. Results from paired-sample t-tests show that both tree-based ML algorithms reveal better performance than each non-tree-based ML algorithm for the four ML performance measures (accuracy, precision, recall and F1 score) considered in this study, each at p<0.001 significance level. This performance superiority is consistent across both the model development and test phases. This study also used paired-sample t-tests for the subsets of the research datasets from disease prediction (66) and university-ranking (50) research contexts for further validation. The observed superiority of the tree-based ML algorithms remains valid for these subsets. Tree-based ML algorithms significantly outperformed non-tree-based algorithms for these two research contexts for all four performance measures. We discuss the research implications of these findings in detail in this article.

Indexed as

AlgorithmsMachine LearningHumansLogistic ModelsSupport Vector Machine

Identifiers

PMID38635591
PMCPMC11025817

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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.