A Note on Spectral Lower Bound Arguments for Decision Trees
Carsten DammPublished in: Universität Trier, Mathematik/Informatik, Forschungsbericht (1997)
Keyphrases
- lower bound
- decision trees
- upper bound
- branch and bound algorithm
- branch and bound
- decision tree induction
- np hard
- worst case
- lower and upper bounds
- naive bayes
- predictive accuracy
- machine learning
- optimal solution
- data mining methods
- spectral analysis
- objective function
- training data
- decision rules
- decision tree learning
- hyperspectral imagery
- decision tree algorithm
- random forest
- rule induction
- feature construction
- sufficiently accurate
- lower bounding
- linear programming relaxation
- argumentation frameworks
- machine learning algorithms
- multispectral images
- online algorithms
- ensemble methods
- training set
- classification rules
- argumentation systems
- polynomial approximation
- infrared