Unsupervised and Semi-supervised Lagrangian Support Vector Machines

  • Authors:
  • Kun Zhao;Ying-Jie Tian;Nai-Yang Deng

  • Affiliations:
  • College of Science, China Agricultural University, ;Chinese Academy of Sciences, Research Center on Data Technology and Knowledge Economy, ;College of Science, China Agricultural University,

  • Venue:
  • ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Support Vector Machines have been a dominant learning technique for almost ten years, moreover they have been applied to supervised learning problems. Recently two-class unsupervised and semi-supervised classification problems based on Bounded C-Support Vector Machines and Bounded 驴-Support Vector Machines are relaxed to semi-definite programming [4][11]. In this paper we will present another version to unsupervised and semi-supervised classification problems based on Lagrangian Support Vector Machines, which trained by convex relaxation of the training criterion: find a labelling that yield a maximum margin on the training data. But the problems have difficulty to compute, we will find their semi-definite relaxations that can approximate them well. Experimental results show that our new unsupervised and semi-supervised classification algorithms often obtain almost the same accurate results as the unsupervised and semi-supervised methods [4][11], while considerably faster than them.