Lower bounds on testing membership to a polyhedron by algebraic decision trees.
Dima GrigorievMarek KarpinskiNicolai N. Vorobjov Jr.Published in: STOC (1994)
Keyphrases
- lower bound
- decision trees
- upper bound
- branch and bound
- branch and bound algorithm
- predictive accuracy
- objective function
- upper and lower bounds
- naive bayes
- decision rules
- decision tree induction
- test cases
- convex hull
- random forest
- data mining methods
- software testing
- machine learning algorithms
- optimal solution
- training data
- ensemble methods
- machine learning
- euclidean space
- lower and upper bounds
- attribute selection
- constructive induction
- decision tree algorithm
- decision tree learning
- extreme points