Pages that link to "Item:Q1332700"
From MaRDI portal
The following pages link to Trading accuracy for simplicity in decision trees (Q1332700):
Displaying 12 items.
- Post-pruning in decision tree induction using multiple performance measures (Q883297) (← links)
- Stochastic dynamic programming with factored representations (Q1583230) (← links)
- Bi-criteria optimization of decision trees with applications to data analysis (Q1754136) (← links)
- Correction to: ``Trading off worst and expected cost in decision tree problems'' (Q1755752) (← links)
- Evaluation of decision trees: a multi-criteria approach (Q1885961) (← links)
- An efficient algorithm for optimal pruning of decision trees (Q2171261) (← links)
- An experimental evaluation of simplicity in rule learning (Q2389614) (← links)
- The effects of pruning methods on the predictive accuracy of induced decision trees (Q2711697) (← links)
- (Q4386958) (← links)
- Decision Tree Heuristics Can Fail, Even in the Smoothed Setting (Q6070388) (← links)
- Regularized impurity reduction: accurate decision trees with complexity guarantees (Q6486128) (← links)
- Loss-optimal classification trees: a generalized framework and the logistic case (Q6592928) (← links)