Decision Tree Classification
Decision Tree Classification is a supervised machine learning algorithm that belongs to the family of tree-based models, distinguished by its use of a hierarchical, rule-based structure to recursively partition feature space into discrete class labels based on optimal split criteria derived from training data.
3.5K
Publications
241.1K
Citations
11.4K
Authors
3.4K
Institutions
Publications per year
2017–2026
1.6K
3.5K
Classification and regression trees
J. Praagman · European Journal of Operational Research · 1985 · 10.2K citations
Tin Kam Ho · 2002 · 5K citations
1–5 of 3.5K
11.4K
11
h-index
11
h-index
9
h-index
9
h-index
9
h-index
1–5 of 11.4K
3.4K
Yale University
New Haven, United States
18 h-index
44 publications
2.5K citations
Vellore Institute of Technology University
Vellore, India
18 h-index
64 publications
8.3K citations
University of Michigan
Ann Arbor, United States
16 h-index
38 publications
2K citations
Purdue University West Lafayette
West Lafayette, United States
16 h-index
24 publications
11.4K citations
University of Wisconsin–Madison
Madison, United States
16 h-index
30 publications
6.4K citations
Universidade de São Paulo
São Paulo, Brazil
15 h-index
37 publications
2K citations

Chinese Academy of Sciences
Beijing, China
15 h-index
62 publications
3.5K citations

Johns Hopkins University
Baltimore, United States
15 h-index
51 publications
2.4K citations
1–8 of 3.4K
48 publications · 5K citations
36
h-index
36 publications · 2.4K citations
24
h-index
51 publications · 2.7K citations
23
h-index
29 publications · 1.8K citations
23
h-index
36 publications · 2.8K citations
23
h-index
1–5