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
Parents
491
Decision tree methods: applications for classification and prediction
VA Palo · 2015 · 1.3K citations
Computing, Data Science, Data Mining +12
Decision tree methods: applications for classification and prediction.
Yan Song, Ying Lü · PubMed · 2015 · 1.1K citations
Computing, Data Science, Data Mining +12
The early prediction of mortality in acute pancreatitis: a large population-based study
Bing Wu, R.S. Johannes, Xiaowu Sun et al. · Gut · 2008 · 898 citations · Full text
1–5 of 491
2K
4
h-index
National and Kapodistrian University of Athens, Greece
3 publications · 76 citations
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 2K
1K
Carnegie Mellon University
Pittsburgh, United States
8 h-index
27 publications
1.2K citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
10 publications
402 citations
University of Wisconsin–Madison
Madison, United States
6 h-index
8 publications
528 citations

Tarbiat Modares University
Tehran, Iran
6 h-index
9 publications
788 citations
Inserm
Paris, France
6 h-index
16 publications
657 citations
Université Paris Cité
Paris, France
6 h-index
10 publications
767 citations
University of Pittsburgh
Pittsburgh, United States
5 h-index
12 publications
565 citations
Duke University
Durham, United States
5 h-index
10 publications
1.6K citations
1–8 of 1K
6 publications · 310 citations
6
h-index
6 publications · 192 citations
6
h-index
JCGS · 6 publications · 391 citations
6
h-index
5 publications · 161 citations
5
h-index
5 publications · 143 citations
5
h-index
1–5