A class of semi-supervised support vector machines by DC programming

  • Authors:
  • Liming Yang;Laisheng Wang

  • Affiliations:
  • College of Science, China Agricultural University, Beijing, China;College of Science, China Agricultural University, Beijing, China

  • Venue:
  • Advances in Data Analysis and Classification
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper investigate a class of semi-supervised support vector machines ($$\text{ S }^3\mathrm{VMs}$$S3VMs) with arbitrary norm. A general framework for the $$\text{ S }^3\mathrm{VMs}$$S3VMs was first constructed based on a robust DC (Difference of Convex functions) program. With different DC decompositions, DC optimization formulations for the linear and nonlinear $$\text{ S }^3\mathrm{VMs}$$S3VMs are investigated. The resulting DC optimization algorithms (DCA) only require solving simple linear program or convex quadratic program at each iteration, and converge to a critical point after a finite number of iterations. The effectiveness of proposed algorithms are demonstrated on some UCI databases and licorice seed near-infrared spectroscopy data. Moreover, numerical results show that the proposed algorithms offer competitive performances to the existing $$\text{ S }^3\mathrm{VM}$$S3VM methods.