Branch and Bound for Semi-Supervised Support Vector Machines

Chapelle, Olivier, Sindhwani, Vikas, Keerthi, S. S.

Dec-31-2007–Neural Information Processing Systems

VM) attempt to learn low-density separators by maximizing the margin over labeled and unlabeled examples. The associated optimization problem is non-convex.

implementation, objective function, unlabeled point, (14 more...)

Neural Information Processing Systems

Dec-31-2007

Conferences PDF

Country:
- North America > United States
  - New York (0.04)
  - Illinois > Cook County
    - Chicago (0.04)
- Europe > Germany
  - Baden-Württemberg > Tübingen Region > Tübingen (0.14)

Technology:
- Information Technology > Artificial Intelligence
  - Representation & Reasoning > Search (1.00)
  - Machine Learning > Statistical Learning
    - Support Vector Machines (1.00)

Duplicate Docs Excel Report

Title
Branch and Bound for Semi-Supervised Support Vector Machines
Branch and Bound for Semi-Supervised Support Vector Machines

Similar Docs Excel Report more

Title	Similarity	Source
None found