Adapting Codes and Embeddings for Polychotomies

Rätsch, G; Smola, A; Mika, S

アイテム詳細

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

一時保存へ追加

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

公開

会議論文

Adapting Codes and Embeddings for Polychotomies

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

https://papers.nips.cc/paper/2166-adapting-codes-and-embeddings-for-polychotomies.pdf
(出版社版)

Fulltext (restricted access)

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

フルテキスト (公開)

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

付随資料 (公開)

There is no public supplementary material available

引用

Rätsch, G., Smola, A., & Mika, S. (2003). Adapting Codes and Embeddings for Polychotomies. In S., Becker, S., Thrun, & K., Obermayer (Eds.), Advances in Neural Information Processing Systems 15 (pp. 513-520). Cambridge, MA, USA: MIT Press.

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

要旨

In this paper we consider formulations of multi-class problems based on a generalized notion of a margin and using output coding. This includes, but is not restricted to, standard multi-class SVM formulations. Differently
from many previous approaches we learn the code as well as the embedding function. We illustrate how this can lead to a formulation that allows for solving a wider range of problems with for instance many classes or even “missing classes”. To keep our optimization problems tractable we propose an algorithm capable of solving them using twoclass
classifiers, similar in spirit to Boosting.