An Inexact Implementation of Smoothing Homotopy Method for Semi-Supervised Support Vector Machines

HTML  XML Download Download as PDF (Size: 435KB)  PP. 1-7  
DOI: 10.4236/jdaip.2013.11001    4,699 Downloads   11,930 Views  
Author(s)

ABSTRACT

Semi-supervised Support Vector Machines is an appealing method for using unlabeled data in classification. Smoothing homotopy method is one of feasible method for solving semi-supervised support vector machines. In this paper, an inexact implementation of the smoothing homotopy method is considered. The numerical implementation is based on a truncated smoothing technique. By the new technique, many “non-active” data can be filtered during the computation of every iteration so that the computation cost is reduced greatly. Besides this, the global convergence can make better local minima and then result in lower test errors. Final numerical results verify the efficiency of the method.

Share and Cite:

Xiong, H. and Shi, F. (2013) An Inexact Implementation of Smoothing Homotopy Method for Semi-Supervised Support Vector Machines. Journal of Data Analysis and Information Processing, 1, 1-7. doi: 10.4236/jdaip.2013.11001.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.