Lower Bounds for Linear Decision Trees via an Energy Complexity Argument.
Kei UchizawaEiji TakimotoPublished in: MFCS (2011)
Keyphrases
- lower bound
- decision trees
- worst case
- upper bound
- decision tree induction
- energy consumption
- linear complexity
- computational complexity
- energy minimization
- average case complexity
- naive bayes
- np hard
- decision problems
- branch and bound
- branch and bound algorithm
- space complexity
- training data
- learning algorithm
- decision tree learning
- data sets