Semi supervised learning: Branch and Bound

Implementation of global optimization algorithms, preferably in python, to trai a SVM in which some of the data has no label

Many algorithms exist for S3VM – exact (branch and bound) and heuristic (global optimization). We aim at implementing some of these in order to find a computationally efficient scheme.

Image credit: http://www.cs.cmu.edu/~dmunoz/images/cmutr10.png

Candidate: Francesco Marchetti (but other candidates can be accepted for more research on this topic)

graduated february 2016