Least Square Transduction Support Vector Machine

  • Authors:
  • Rui Zhang;Wenjian Wang;Yichen Ma;Changqian Men

  • Affiliations:
  • School of Science, Xi'an Jiaotong University, Xi'an, People's Republic of China 710049 and School of Mathematics and Information Science, Shandong University of Technology, Zibo, People's Republic ...;Key Laboratory of Computational Intelligence & Chinese Information Processing of Ministry of Education, School of Computer and Information Technology, Shanxi University, Taiyuan, People's Republic ...;School of Science, Xi'an Jiaotong University, Xi'an, People's Republic of China 710049;Key Laboratory of Computational Intelligence & Chinese Information Processing of Ministry of Education, School of Computer and Information Technology, Shanxi University, Taiyuan, People's Republic ...

  • Venue:
  • Neural Processing Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Support vector machine (SVM) is a general and powerful learning machine, which adopts supervised manner. However, for many practical machine learning and data mining applications, unlabeled training examples are readily available but labeled ones are very expensive to be obtained. Therefore, semi-supervised learning emerges as the times require. At present, the combination of SVM and semi-supervised learning principle such as transductive learning has attracted more and more attentions. Transductive support vector machine (TSVM) learns a large margin hyperplane classifier using labeled training data, but simultaneously force this hyperplane to be far away from the unlabeled data. TSVM might seem to be the perfect semi-supervised algorithm since it combines the powerful regularization of SVMs and a direct implementation of the clustering assumption, nevertheless its objective function is non-convex and then it is difficult to be optimized. This paper aims to solve this difficult problem. We apply least square support vector machine to implement TSVM, which can ensure that the objective function is convex and the optimization solution can then be easily found by solving a set of linear equations. Simulation results demonstrate that the proposed method can exploit unlabeled data to yield good performance effectively.