A new dual ν-support vector machine

  • Authors:
  • Jia Yinshan;Wang Yumei

  • Affiliations:
  • School of Information Technology, Liaoning University of Petroleum and Chemical Technology, Fushun, China;Computing Center, Qingdao Port Co, Ltd., Qingdao, China

  • Venue:
  • ICONIP'06 Proceedings of the 13 international conference on Neural Information Processing - Volume Part I
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

ν-Support Vector Machine is one of the most widely used support vector machines because it provides a way to control the fraction of margin errors and the fraction of support vectors. However, being biased towards the class with the more training samples prevent it from being applied to some applications in which the size of classes is uneven. Although some updated ν-SVMs have been proposed to solve this problem, there are some issues in the formulations of these updated ν-SVMs. In this paper, a new ν-SVM, Double-ν Support Vector Machine, is proposed. It introduces ν+1 and ν−1 to control the upper bound on the fraction of bound support vectors and the lower bound on the fraction of support vectors of the positive class and the negative class respectively. Moreover, it reduces the complexity of formulations by eliminating a redundant constrain in ν-SVM formulations.