Pages that link to "Item:Q2475411"
From MaRDI portal
The following pages link to Minimization of decision trees is hard to approximate (Q2475411):
Displaying 7 items.
- Correlation based splitting criterionin multi branch decision tree (Q692985) (← links)
- Feature minimization within decision trees (Q1384090) (← links)
- On the hardness of the minimum height decision tree problem (Q1885823) (← links)
- FINDING SMALL EQUIVALENT DECISION TREES IS HARD (Q5249043) (← links)
- New degree bounds for polynomial threshold functions (Q5894427) (← links)
- Decision Tree Heuristics Can Fail, Even in the Smoothed Setting (Q6070388) (← links)
- Properly learning decision trees in almost polynomial time (Q6551255) (← links)