摘要

Semi-supervised learning is an attractive method in classification problems when insufficient training information is available. In this investigation,a new semi-supervised classifier is proposed based on the concept of maximum vector-angular margin, (called S3MAMC), the main goal of which is to find an optimal vector c as close as possible to the center of the dataset consisting of both labeled samples and unlabeled samples. This makes S3MAMC better generalization with smaller VC (Vapnik-Chervonenkis ) dimension. However, S3MAMC formulation is a non-convex model and therefore it is difficult to solve. Following that we present two optimization algorithms, mixed integer quadratic program (MIQP) and DC (difference of convex functions) program algorithms, to solve the S3MAMC. Compared with the supervised learning methods, numerical experiments on real and synthetic databases demonstrate that the S3MAMC can improve generalization when the labelled samples are relatively few. In addition, the S3MAMC has competitive experiment results in generalization compared to the traditional semi-supervised classification methods.

全文