On the hardness of the minimum height decision tree problem.
Eduardo Sany LaberLoana Tito NogueiraPublished in: Discret. Appl. Math. (2004)
Keyphrases
- decision trees
- decision tree induction
- decision tree learning
- machine learning algorithms
- predictive accuracy
- logistic regression
- learning theory
- np hard
- worst case
- data structure
- information gain
- square error
- real time
- decision tree algorithms
- decision tree classifiers
- random forest
- ensemble methods
- phase transition
- upper bound
- computational complexity
- training data
- data mining
- neural network
- data sets