A general splitting criterion for classification trees
From MaRDI portal
Publication:1299513
zbMATH Open0962.62060MaRDI QIDQ1299513FDOQ1299513
Authors: Francesco Mola, R. Siciliano 
Publication date: 19 June 2001
Published in: Metron (Search for Journal in Brave)
Recommendations
CARTfast algorithmheterogeneityimpurityconditional entropy indexmaximal binary treepredictability index tau
Cited In (17)
- A procedure for improving generalization in classification trees
- Correlation based splitting criterionin multi branch decision tree
- A statistical approach to growing a reliable honest tree.
- Splitting methods for decision tree induction: An exploration of the relative performance of two entropy-based families
- Stability and scalability in decision trees
- Ordinal classification trees based on impurity measures
- PERFORMANCE OF A LOCALIZED TREE SPLITTING CRITERION IN TREE AVERAGING
- Growing and Visualizing Prediction Paths Trees in Market Basket Analysis
- A new metric splitting criterion for decision trees
- Methods and Applications of Artificial Intelligence
- Classification trees for ordinal variables
- An explicit split point procedure in model-based trees allowing for a quick fitting of GLM trees and GLM forests
- Theoretical comparison between the Gini Index and Information Gain criteria
- Selecting the best splits for classification trees with categorical variables
- Unbiased split selection for classification trees based on the Gini index
- Multivariate data analysis and modeling through classification and regression trees
- On the quest for easy-to-understand splitting rules
This page was built for publication: A general splitting criterion for classification trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1299513)
