Three Steps Strategy to Search for Optimum Classification Trees

DOI10.1080/03610918.2013.867991zbMATH Open1359.62231OpenAlexW2031248468MaRDI QIDQ2809627FDOQ2809627

Authors: Muhammad Umer Azam, Muhammad Aslam, Karl Peter Pfeiffer 

Publication date: 30 May 2016

Published in: Communications in Statistics. Simulation and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610918.2013.867991

Recommendations

• Optimization of classification trees: Strategy and algorithm improvement
• A novel algorithm to optimize classification trees
• Optimal classification trees
• Optimal classification trees
• Multi-Step Classification Trees
• Appraisal of performance of three tree-based classification methods
• Optimal randomized classification trees
• A procedure for improving generalization in classification trees
• On Optimization of Decision Trees

zbMATH Keywords

evaluation functionsoptimum classification treesthree steps strategyvalue-wise tree sequencevariable-wise tree sequence

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites Work

• Title not available (Why is that?)
• Random forests
• Unbiased split selection for classification trees based on the Gini index
• A note on split selection bias in classification trees
• Splitting variable selection for multivariate regression trees
• Title not available (Why is that?)
• Data mining and data visualization
• On the quest for easy-to-understand splitting rules
• Multi-Step Classification Trees

Cited In (2)

• An MLE strategy for combining optimally pruned decision trees
• Title not available (Why is that?)

Uses Software

• Matlab
• R
• CRAN
• rpart
• RWeka
• tree
• C4.5
• THAID

This page was built for publication: Three Steps Strategy to Search for Optimum Classification Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809627)