Fast Localized Twin SVM

Abstract

Twin Support Vector Machine (Twin SVM), which is a new binary classifier as an extension of SVMs, was first proposed in 2007 by Jayadeva. Wide attention has been attracted by academic circles for its less computation cost and better generalization ability, and it became a new research priorities gradually. A simple geometric interpretation of Twin SVM is that each hyperplane is closest to the points of its own class and as far as possible from the points of the other class. This method defines two nonparallel hyper-planes by solving two related SVM-type problems. Localized Twin SVM is a classification approach via local information which is based on Twin SVM, and has been proved by experiments having a better performance than conventional Twin SVM. However, the computational cost of the method is so high that it has little practical applications. In this paper we propose a method called Fast Localized Twin SVM, a classifier built so as to be suitable for large data sets, in which the number of Twin SVMs is decreased. In Fast Localized Twin SVM, we first use the training set to compute a set of Localized Twin SVMs, then assign to each local model all the points lying in the central neighborhood of the k training points. The query point depending on its nearest neighbor in the training set can be predicted. From empirical experiments we can show that our approach not only guarantees high generalization ability but also improves the computational cost greatly, especially for large scale data sets.