Localized Support Vector Machines for Classification

Support vector machines (SVMs) have been promising methods in pattern recognition because of their solid mathematical foundation. In this paper, we propose a localized SVM classification scheme (LSVM). In which we first cluster the training data in each category, and then train a set of SVMs based on these dusters. The SVMs trained from the clusters in each category that are nearest to the given input pattern are then selected for the final classification. Our experiments on six UCI datasets show that LSVM outperforms the traditional SVM.