A Recursive Partitioning Rule for Binary Decision Trees |
Kim, Sang-Guin (Division of Economics, Kyonggi University) |
1 |
Asymptotically efficient, computationally feasible solutions to the classification problem
/
DOI ScienceOn |
2 |
Tree-based models
/
|
3 |
/
|
4 |
A recursive partitioning decision rule for nonparametric classification
/
DOI ScienceOn |
5 |
A new criterion in selection and discretization of attributes for generation of decision trees
/
DOI ScienceOn |
6 |
Selecting the best splits for classification trees with categorical variables
/
DOI ScienceOn |
7 |
Measures of association for cross-classifications
/
DOI ScienceOn |
8 |
/
|
9 |
An exploratory technique for investigation large quantities of categorical data
/
DOI ScienceOn |
10 |
Block diagrams and splitting criteria for classification trees
/
DOI |
11 |
/
|
12 |
A fast splitting procedure for classification trees
/
DOI ScienceOn |
13 |
A combined nonparametric approach to feature selection and binary decision tree design
/
DOI ScienceOn |