Multitask multiclass support vector machines: Model and experiments

doi:10.1016/j.patcog.2012.08.010

Return

Multitask multiclass support vector machines: Model and experiments

2013-03-01

PRE

Shiliang Sun *

DOI：10.1016/j.patcog.2012.08.010

Original

Original request for help

Save

Abstract

En 中文

Multitask learning or learning multiple related tasks simultaneously has shown a better performance than learning these tasks independently. Most approaches to multitask multiclass problems decompose them into multiple multitask binary problems, and thus cannot effectively capture inherent correlations between classes. Although very elegant, traditional multitask support vector machines are restricted by the fact that different learning tasks have to share the same set of classes. In this paper, we present an approach to multitask multiclass support vector machines based on the minimization of regularization functionals. We cast multitask multiclass problems into a constrained optimization problem with a quadratic objective function. Therefore, our approach can learn multitask multiclass problems directly and effectively. This approach can learn in two different scenarios: label-compatible and label-incompatible multitask learning. We can easily generalize the linear multitask learning method to the non-linear case using kernels. A number of experiments, including comparisons with other multitask learning methods, indicate that our approach for multitask multiclass problems is very encouraging. (C) 2012 Elsevier Ltd. All rights reserved.

Keywords:

Multiclass classification

Multitask learning

Support vector machine

Kernel

Regularization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.