Branch and Bound for Semi-Supervised Support Vector Machines

Chapelle, O; Sindhwani, V; Keerthi, SS

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Branch and Bound for Semi-Supervised Support Vector Machines

MPS-Authors

/persons/resource/persons83855

Chapelle, O
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource

https://papers.nips.cc/paper/3135-branch-and-bound-for-semi-supervised-support-vector-machines.pdf
(出版社版)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Chapelle, O., Sindhwani, V., & Keerthi, S. (2007). Branch and Bound for Semi-Supervised Support Vector Machines. In B., Schölkopf, J., Platt, & T., Hoffman (Eds.), Advances in Neural Information Processing Systems 19 (pp. 217-224). Cambridge, MA, USA: MIT Press.

引用: https://hdl.handle.net/11858/00-001M-0000-0013-CBD7-7

要旨

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 implementations, we apply branch and bound techniques for obtaining exact, globally optimal solutions. Empirical evidence suggests that the globally optimal solution can return excellent generalization performance in situations where other implementations fail completely. While our current implementation is only applicable to small datasets,
we discuss variants that can potentially lead to practically useful algorithms.