Improving the precision of classification trees
From MaRDI portal
Abstract: Besides serving as prediction models, classification trees are useful for finding important predictor variables and identifying interesting subgroups in the data. These functions can be compromised by weak split selection algorithms that have variable selection biases or that fail to search beyond local main effects at each node of the tree. The resulting models may include many irrelevant variables or select too few of the important ones. Either eventuality can lead to erroneous conclusions. Four techniques to improve the precision of the models are proposed and their effectiveness compared with that of other algorithms, including tree ensembles, on real and simulated data sets.
Recommendations
Cites work
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 47310 (Why is no real title available?)
- scientific article; zbMATH DE number 1089157 (Why is no real title available?)
- scientific article; zbMATH DE number 1149421 (Why is no real title available?)
- scientific article; zbMATH DE number 3434963 (Why is no real title available?)
- scientific article; zbMATH DE number 1547349 (Why is no real title available?)
- scientific article; zbMATH DE number 1779487 (Why is no real title available?)
- scientific article; zbMATH DE number 2200689 (Why is no real title available?)
- 10.1162/153244304322972694
- A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms
- An unbiased method for constructing multilabel classification trees
- FUNDAMENTAL GROUPS
- Functional trees
- Heuristics of instability and stabilization in model selection
- Problems in the Analysis of Survey Data, and a Proposal
- Random forests
- The Distribution of Chi-Square
- Tree-Structured Classification Via Generalized Discriminant Analysis
- Unbiased split selection for classification trees based on the Gini index
- Unbiased variable selection for classification trees with multivariate responses
- Using \(k\)-nearest-neighbor classification in the leaves of a tree
Cited in
(49)- A procedure for improving generalization in classification trees
- Supervised classification and mathematical optimization
- Accounting for shared covariates in semiparametric Bayesian additive regression trees
- Model trees with topic model preprocessing: an approach for data journalism illustrated with the WikiLeaks Afghanistan war logs
- Composite large margin classifiers with latent subclasses for heterogeneous biomedical data
- Modeling threshold interaction effects through the logistic classification trunk
- Nonparametric variable selection and classification: the CATCH algorithm
- Accurate ensemble pruning with PL-bagging
- scientific article; zbMATH DE number 1983958 (Why is no real title available?)
- scientific article; zbMATH DE number 1881089 (Why is no real title available?)
- Count regression trees
- The reliability of classification of terminal nodes in GUIDE decision tree to predict the nonalcoholic fatty liver disease
- Appraisal of performance of three tree-based classification methods
- Maximizing adjusted covariance: new supervised dimension reduction for classification
- A note on the interpretation of tree-based regression models
- On hybrid tree-based methods for short-term insurance claims
- Model-based recursive partitioning for subgroup analyses
- T3C: improving a decision tree classification algorithm's interval splits on continuous attributes
- Phylogenetic tree selection by the adjustedk-means approach
- Training trees on tails with applications to portfolio choice
- Classification tree analysis using TARGET
- Canonical forest
- scientific article; zbMATH DE number 1629814 (Why is no real title available?)
- A weight-adjusted voting algorithm for ensembles of classifiers
- bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition
- An alternative pruning based approach to unbiased recursive partitioning
- A platform for comparing subgroup identification methodologies
- Regression trees for longitudinal and multiresponse data
- Binary multi-layer classifier
- Seemingly unrelated regression tree
- Inductive Logic Programming
- Random forest variable importance-based selection algorithm in class imbalance problem
- Unified Noncrossing Multiple Quantile Regressions Tree
- PPtree: projection pursuit classification tree
- A regression tree approach to identifying subgroups with differential treatment effects
- Disjunctive Rule Lists
- Predicting missing values: a comparative study on non-parametric approaches for imputation
- Partially Bayesian variable selection in classification trees
- An omnibus test for detection of subgroup treatment effects via data partitioning
- Node harvest
- A new classification tree method with interaction detection capability
- Model-based recursive partitioning algorithm to penalized non-crossing multiple quantile regression for the right-censored data
- Subgroup identification with classification and regression tree-based algorithms: an application to the ball state adult fitness longitudinal study
- Gaining insight with recursive partitioning of generalized linear models
- Double random forest
- Identification of subgroups with differential treatment effects for longitudinal and multiresponse variables
- A note on split selection bias in classification trees
- A nonparametric method for classification trees using grouped covariates
- New optimization models for optimal classification trees
This page was built for publication: Improving the precision of classification trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965140)
