A best-first branch-and-bound search for solving the transductive inference problem using support vector machines.
Hygor Xavier AraújoRaul Fonseca NetoSaulo Moraes VillelaPublished in: ESANN (2019)
Keyphrases
- branch and bound search
- transductive inference
- constraint optimization
- branch and bound
- search heuristics
- search tree
- arc consistency
- search algorithm
- search strategy
- iterative deepening
- cutting plane algorithm
- inductive inference
- lagrangian relaxation
- constraint programming
- tabu search
- lower bound
- combinatorial optimization
- constraint satisfaction problems
- dynamic programming
- knapsack problem
- search problems
- maximum margin
- space complexity
- machine learning
- branch and bound algorithm
- text categorization
- np hard
- optimal solution