A multitask learning model for online pattern recognition
S Ozawa, A Roy, D Roussinov - IEEE Transactions on Neural …, 2009 - ieeexplore.ieee.org
S Ozawa, A Roy, D Roussinov
IEEE Transactions on Neural Networks, 2009•ieeexplore.ieee.orgThis paper presents a new learning algorithm for multitask pattern recognition (MTPR)
problems. We consider learning multiple multiclass classification tasks online where no
information is ever provided about the task category of a training example. The algorithm
thus needs an automated task recognition capability to properly learn the different
classification tasks. The learning mode is ldquoonlinerdquo where training examples for
different tasks are mixed in a random fashion and given sequentially one after another. We …
problems. We consider learning multiple multiclass classification tasks online where no
information is ever provided about the task category of a training example. The algorithm
thus needs an automated task recognition capability to properly learn the different
classification tasks. The learning mode is ldquoonlinerdquo where training examples for
different tasks are mixed in a random fashion and given sequentially one after another. We …
This paper presents a new learning algorithm for multitask pattern recognition (MTPR) problems. We consider learning multiple multiclass classification tasks online where no information is ever provided about the task category of a training example. The algorithm thus needs an automated task recognition capability to properly learn the different classification tasks. The learning mode is ldquoonlinerdquo where training examples for different tasks are mixed in a random fashion and given sequentially one after another. We assume that the classification tasks are related to each other and that both the tasks and their training examples appear in random during ldquoonline training.rdquo Thus, the learning algorithm has to continually switch from learning one task to another whenever the training examples change to a different task. This also implies that the learning algorithm has to detect task changes automatically and utilize knowledge of previous tasks for learning new tasks fast. The performance of the algorithm is evaluated for ten MTPR problems using five University of California at Irvine (UCI) data sets. The experiments verify that the proposed algorithm can indeed acquire and accumulate task knowledge and that the transfer of knowledge from tasks already learned enhances the speed of knowledge acquisition on new tasks and the final classification accuracy. In addition, the task categorization accuracy is greatly improved for all MTPR problems by introducing the reorganization process even if the presentation order of class training examples is fairly biased.
ieeexplore.ieee.org