Multitask Classification by Learning the Task Relevance

doi:10.1109/LSP.2008.2001967

Return

Multitask Classification by Learning the Task Relevance

2008-01-01

PRE

DOI：10.1109/LSP.2008.2001967

Original

Original request for help

Save

Abstract

En 中文

We consider the problem of multitask learning (MTL), in which we simultaneously learn classifiers for multiple data sets (tasks), with sharing of intertask data as appropriate. We introduce a set of relevance parameters that control the degree to which data from other tasks are used in estimating the current task's classifier parameters. The set of relevance parameters are learned by maximizing their posterior probability, yielding an expectation-maximization (EM) algorithm. We illustrate the effectiveness of our approach through experimental results on a practical data set.

Keywords:

Classification

expectation-maximization algorithm

multitask learning

AI Summary

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