Branch and Bound for Semi-Supervised Support Vector Machines.
Olivier ChapelleVikas SindhwaniS. Sathiya KeerthiPublished in: NIPS (2006)
Keyphrases
- branch and bound
- semi supervised support vector machines
- semi supervised
- search algorithm
- branch and bound algorithm
- lower bound
- semi supervised learning
- upper bound
- search space
- column generation
- optimal solution
- combinatorial optimization
- tree search
- support vector machine
- branch and bound procedure
- beam search
- branch and bound method
- randomly generated problems
- tree search algorithm
- depth first search
- branch and bound search
- data sets
- lagrangian heuristic
- network design problem
- linear programming relaxation
- pairwise
- max sat
- search tree
- supervised learning
- np hard
- learning algorithm