Pages that link to "Item:Q1282931"
From MaRDI portal
The following pages link to A novel algorithm to optimize classification trees (Q1282931):
Displaying 22 items.
- Classification trees with soft splits optimized for ranking (Q120445) (← links)
- Classification tree analysis using TARGET (Q1023462) (← links)
- Optimization of classification trees: Strategy and algorithm improvement (Q1295809) (← links)
- A general splitting criterion for classification trees (Q1299513) (← links)
- Automatic construction of decision trees for classification (Q1339179) (← links)
- Linearity criterion for the selection of an optimal tree (Q1367936) (← links)
- A procedure for improving generalization in classification trees (Q1852018) (← links)
- Controlling overfitting in classification-tree models of software quality (Q1859395) (← links)
- Stability and scalability in decision trees (Q1887226) (← links)
- Column generation based heuristic for learning classification trees (Q2289946) (← links)
- T3C: improving a decision tree classification algorithm's interval splits on continuous attributes (Q2418312) (← links)
- Optimal randomized classification trees (Q2668720) (← links)
- Segmentation trees for stratified data (Q2756648) (← links)
- Three Steps Strategy to Search for Optimum Classification Trees (Q2809627) (← links)
- Oblique multicategory decision trees using nonlinear programming (Q2890453) (← links)
- Improved Decision Tree Algorithm: ID3+ (Q3063034) (← links)
- Soft Classification Trees (Q3167861) (← links)
- Splitting theorems for classification and regression trees (Q3983185) (← links)
- Learning Theory (Q4680891) (← links)
- A general property among nested, pruned subtrees of a decision-support tree (Q4843794) (← links)
- Optimal classification trees (Q5915854) (← links)
- A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms (Q5938648) (← links)
