Laplacian smooth twin support vector machine for semi-supervised classification

Original Article

DOI: 10.1007/s13042-013-0183-3

Cite this article as:
Chen, WJ., Shao, YH. & Hong, N. Int. J. Mach. Learn. & Cyber. (2014) 5: 459. doi:10.1007/s13042-013-0183-3

Abstract

Laplacian twin support vector machine (Lap-TSVM) is a state-of-the-art nonparallel-planes semi-supervised classifier. It tries to exploit the geometrical information embedded in unlabeled data to boost its generalization ability. However, Lap-TSVM may endure heavy burden in training procedure since it needs to solve two quadratic programming problems (QPPs) with the matrix “inversion” operation. In order to enhance the performance of Lap-TSVM, this paper presents a new formulation of Lap-TSVM, termed as Lap-STSVM. Rather than solving two QPPs in dual space, firstly, we convert the primal constrained QPPs of Lap-TSVM into unconstrained minimization problems (UMPs). Afterwards, a smooth technique is introduced to make these UMPs twice differentiable. At last, a fast Newton–Armijo algorithm is designed to solve the UMPs in Lap-STSVM. Experimental evaluation on both artificial and real-world datasets demonstrate the benefits of the proposed approach.

Keywords

Semi-supervised classificationManifold regularizationTwin support vector machineSmooth technique

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Zhijiang CollegeZhejiang University of TechnologyHangzhouPeople’s Republic of China