Unsupervised and Semi-Supervised Bounded V-Support Vector Machines with Polyhedral Perturbations

Support vector machines (SVMs) have been dominant learning techniques for more than ten years, and mostly applied to supervised learning problems. These years two-class unsupervised and semi-supervised classification algorithms based on bounded C-SVMs, bounded j/-SVMs and Lagrangian SVMs (LSVMs) respectively, which are relaxed to semi-definite programming (SDP), get good classification results. These support vector methods implicitly assume that training data in the optimization problems to be known exactly. But in practice, the training data are usually subjected to measurement noise. Zhao et al proposed robust version to bounded C- SVMs, bounded v-SVMs and Lagrangian SVMs (LSVMs) respectively with perturbations in convex polyhedrons and ellipsoids. The region of perturbation in the methods mentioned above is not general, and there are many perturbations in non-convex regions in practice. Therefore we proposed unsupervised and semisupervised classification problems based on bounded v-support vector machines with general polyhedral perturbations. But the problem has difficulty to compute, we will find its semidefinite relaxation that can approximate it well. Numerical results confirm the robustness of the proposed method.