Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees.
Dima GrigorievMarek KarpinskiNicolai N. Vorobjov Jr.Published in: FOCS (1995)
Keyphrases
- lower bound
- decision trees
- upper bound
- predictive accuracy
- branch and bound algorithm
- branch and bound
- objective function
- decision tree induction
- random forest
- naive bayes
- data sets
- test cases
- linear programming
- np hard
- lagrangian relaxation
- feature construction
- classification trees
- lower and upper bounds
- test data
- optimal solution
- learning algorithm