The Decision Tree Complexity for k-SUM is at most Nearly Quadratic.
Esther EzraMicha SharirPublished in: CoRR (2016)
Keyphrases
- decision trees
- objective function
- computational complexity
- decision tree induction
- machine learning
- predictive accuracy
- memory requirements
- pairwise
- databases
- decision table
- computational cost
- active learning
- image sequences
- database
- worst case
- search algorithm
- training data
- space complexity
- feature construction
- decision tree algorithm
- linear functions
- decision tree algorithms