By Topic

A Regularized Maximum Figure-of-Merit (rMFoM) Approach to Supervised and Semi-Supervised Learning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chengyuan Ma ; Nuance Communication, Burlington, MA, USA ; Chin-Hui Lee

We propose a regularized extension to supervised maximum figure-of-merit learning to improve its generalization capability and successfully extend it to semi-supervised learning. The proposed method can be used to approximate any objective function consisting of the commonly used performance metrics. We first derive detailed learning algorithms for supervised learning problems and then extend it to more general semi-supervised scenarios, where only a small part of the training data is labeled. The effectiveness of the proposed approach is justified by several text categorization experiments on different datasets. The novelty of this paper lies in several aspects: 1) Tikhonov regularization is used to alleviate potential overfitting of the maximum figure-of-merit criteria; 2) the regularized maximum figure-of-merit algorithm is successfully extended to semi-supervised learning tasks; 3) the proposed approach has good scalability to large-scale applications.

Published in:

IEEE Transactions on Audio, Speech, and Language Processing  (Volume:19 ,  Issue: 5 )