A ν-twin support vector machine (ν-TSVM) classifier and its geometric algorithms

  • Authors:
  • Xinjun Peng

  • Affiliations:
  • Department of Mathematics, Shanghai Normal University, Shanghai 200234, PR China and Scientific Computing Key Laboratory of Shanghai Universities, Shanghai 200234, PR China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2010

Quantified Score

Hi-index 0.07

Visualization

Abstract

In this paper, a @n-twin support vector machine (@n-TSVM) is presented, improving upon the recently proposed twin support vector machine (TSVM). This @n-TSVM introduces a pair of parameters (@n) to control the bounds of the fractions of the support vectors and the error margins. The theoretical analysis shows that this @n-TSVM can be interpreted as a pair of minimum generalized Mahalanobis-norm problems on two reduced convex hulls (RCHs). Based on the well-known Gilbert's algorithm, a geometric algorithm for TSVM (GA-TSVM) and its probabilistic speed-up version, named PGA-TSVM, are presented. Computational results on several synthetic as well as benchmark datasets demonstrate the significant advantages of the proposed algorithms in terms of both computation complexity and classification accuracy.