Branch and Bound for Semi-Supervised Support Vector Machines

Conference object OPEN
Chapelle, O.; Sindhwani, V.; Keerthi, S.;
(2007)

Semi-supervised SVMs (S3VMs) attempt to learn low-density separators by maximizing the margin over labeled and unlabeled examples. The associated optimization problem is non-convex. To examine the full potential of S3VMs modulo local minima problems in current implement... View more
Share - Bookmark

  • Download from
    MPG.PuRe via MPG.PuRe (Conference object, 2007)
  • Cite this publication