Transductive support vector machines for structured variables

We study the problem of learning kernel machines transductively for structured output variables. Transductive learning can be reduced to combinatorial optimization problems over all possible labelings of the unlabeled data. In order to scale transductive learning to structured variables, we transform the corresponding non-convex, combinatorial, constrained optimization problems into continuous, unconstrained optimization problems. The discrete optimization parameters are eliminated and the resulting differentiable problems can be optimized efficiently. We study the effectiveness of the generalized TSVM on multiclass classification and labelsequence learning problems empirically.

• Type: Conference
• Year: 2007
• Where: ICML
• Authors: Alexander Zien, Ulf Brefeld, Tobias Scheffer
• Keywords: Combinatorial Optimization Problems, ICML 2007, Labelsequence Learning Problems, Machine Learning, Unconstrained Optimization Problems