Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Improvement on projection twin support vector machine

Improvement on projection twin support vector machine Traditional projection twin support vector machines (SVMs) ignore the differences between the categories when establishing the objective functions, which would lessen their generalization performance. To solve the issue, an improved projection twin SVM (abbreviated as IPTSVM) is proposed in this paper, which aims to find two projected directions via a single quadratic programming problem. In their respective subspace, the projected sample points belonging to each category are far from those of the other class. Meanwhile, to enhance the performance, the recursive arithmetic seeks for more than one projection directions for each class. Besides, an effective clipping dual coordinate descent model is adopted to solve the dual problem to accelerate the training process. The linear IPTSVM model could be changed into the nonlinear model by using the kernel metric. Furthermore, the multi-label version of IPTSVM model is developed to deal with the multi-label learning problems. Experiments on a set of public datasets show that the IPTSVM model has significant advantages over the other models in terms of generalization performance. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Neural Computing and Applications Springer Journals

Improvement on projection twin support vector machine

Neural Computing and Applications , Volume 30 (2) – Oct 20, 2017

Loading next page...
 
/lp/springer-journals/improvement-on-projection-twin-support-vector-machine-00CMdIPV1k

References (31)

Publisher
Springer Journals
Copyright
Copyright © 2017 by The Natural Computing Applications Forum
Subject
Computer Science; Artificial Intelligence (incl. Robotics); Data Mining and Knowledge Discovery; Probability and Statistics in Computer Science; Computational Science and Engineering; Image Processing and Computer Vision; Computational Biology/Bioinformatics
ISSN
0941-0643
eISSN
1433-3058
DOI
10.1007/s00521-017-3237-8
Publisher site
See Article on Publisher Site

Abstract

Traditional projection twin support vector machines (SVMs) ignore the differences between the categories when establishing the objective functions, which would lessen their generalization performance. To solve the issue, an improved projection twin SVM (abbreviated as IPTSVM) is proposed in this paper, which aims to find two projected directions via a single quadratic programming problem. In their respective subspace, the projected sample points belonging to each category are far from those of the other class. Meanwhile, to enhance the performance, the recursive arithmetic seeks for more than one projection directions for each class. Besides, an effective clipping dual coordinate descent model is adopted to solve the dual problem to accelerate the training process. The linear IPTSVM model could be changed into the nonlinear model by using the kernel metric. Furthermore, the multi-label version of IPTSVM model is developed to deal with the multi-label learning problems. Experiments on a set of public datasets show that the IPTSVM model has significant advantages over the other models in terms of generalization performance.

Journal

Neural Computing and ApplicationsSpringer Journals

Published: Oct 20, 2017

There are no references for this article.