| Literature DB >> 24678270 |
Junhui Wang1, Xiaotong Shen2, Wei Pan3.
Abstract
In classification, semisupervised learning usually involves a large amount of unlabeled data with only a small number of labeled data. This imposes a great challenge in that it is difficult to achieve good classification performance through labeled data alone. To leverage unlabeled data for enhancing classification, this article introduces a large margin semisupervised learning method within the framework of regularization, based on an efficient margin loss for unlabeled data, which seeks efficient extraction of the information from unlabeled data for estimating the Bayes decision boundary for classification. For implementation, an iterative scheme is derived through conditional expectations. Finally, theoretical and numerical analyses are conducted, in addition to an application to gene function prediction. They suggest that the proposed method enables to recover the performance of its supervised counterpart based on complete data in rates of convergence, when possible.Entities:
Keywords: classification; difference convex programming; nonconvex minimization; regularization; support vectors
Year: 2009 PMID: 24678270 PMCID: PMC3964604
Source DB: PubMed Journal: J Mach Learn Res ISSN: 1532-4435 Impact factor: 3.654