Properly Learning Decision Trees with Queries Is NP-Hard.
Caleb KochCarmen StrassleLi-Yang TanPublished in: CoRR (2023)
Keyphrases
- decision trees
- learning process
- prior knowledge
- query processing
- np hard
- database
- learning systems
- computational complexity
- supervised learning
- databases
- decision tree learning
- query language
- reinforcement learning
- learning algorithm
- data sources
- special case
- linear programming
- feature construction
- constructive induction