Generating logical expressions from positive and negative examples via a branch-and-bound approach.
Evangelos TriantaphyllouAllen L. SoysterSoundar R. T. KumaraPublished in: Comput. Oper. Res. (1994)
Keyphrases
- branch and bound
- positive and negative examples
- search algorithm
- lower bound
- branch and bound algorithm
- negative examples
- positive examples
- upper bound
- search space
- training set
- hypothesis space
- combinatorial optimization
- optimal solution
- training examples
- version space
- positive and negative
- facial expressions
- tree patterns
- branch and bound procedure
- binary classification
- metaheuristic
- training instances
- support vector machine
- np hard