講演抄録/キーワード |
講演名 |
2013-11-12 15:45
[ポスター講演]Support vector comparison machines ○Toby Dylan Hocking・Supaporn Spanurattana・Masashi Sugiyama(Tokyo Inst. of Tech.) IBISML2013-51 |
抄録 |
(和) |
(まだ登録されていません) |
(英) |
In ranking problems, the goal is to learn a ranking function
$r(x)inRR$ from labeled pairs $x,x'$ of input points. In this
paper, we consider the related comparison problem, where the label
$yin{-1,0,1}$ indicates which element of the pair is better, or
if there is no significant difference. We cast the learning problem
as a margin maximization, and show that it can be solved by
converting it to a standard SVM. We compare our algorithm to SVMrank
using simulated data. |
キーワード |
(和) |
/ / / / / / / |
(英) |
support vector machine / quadratic program / linear program / ranking / margin / / comparison / |
文献情報 |
信学技報, vol. 113, no. 286, IBISML2013-51, pp. 115-121, 2013年11月. |
資料番号 |
IBISML2013-51 |
発行日 |
2013-11-05 (IBISML) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
IBISML2013-51 |
|