Cart Algorithm

The CART Algorithm is a decision tree learning method that constructs binary trees by recursively partitioning data using feature-based splits to minimize impurity, distinguishing itself through its use of the Gini index for classification and mean squared error for regression.

491

Publications

27.3K

Citations

2K

Authors

1K

Institutions

Publications per year

2017–2026

209

Variants

Classification And Regression Trees

Authors

2K

  1. XS
    Xiaogang Su

    The University of Texas at El Paso, United States

    4 publications · 618 citations

    4

    h-index

  2. AP
    Abraham Pouliakis

    National and Kapodistrian University of Athens, Greece

    3 publications · 76 citations

    3

    h-index

  3. AB
    Anthony Brockwell

    Carnegie Mellon University, United States

    3 publications · 175 citations

    3

    h-index

  4. AA
    Anastassia Ailamaki

    Carnegie Mellon University, United States

    3 publications · 175 citations

    3

    h-index

  5. CF
    Christos Faloutsos

    Carnegie Mellon University, United States

    3 publications · 175 citations

    3

    h-index

1–5 of 2K

Venues

  1. PLoS ONE

    6 publications · 310 citations

    6

    h-index

  2. IEEE Access

    6 publications · 192 citations

    6

    h-index

  3. Journal of Computational and Graphical Statistics

    JCGS · 6 publications · 391 citations

    6

    h-index

  4. Sustainability

    5 publications · 161 citations

    5

    h-index

  5. Indian Journal of Science and Technology

    5 publications · 143 citations

    5

    h-index

1–5