LAUSR

Support Vector Machine (SVM) is mainly used to classify the data into two categories. To solve the multi-category problems using SVM, researchers used two approaches. The first approach based on solving multiple SVM binary classifiers, whereas another approach based on solving a single optimization problem. In this paper, we have used the first approach and proposed an Efficient Multiclass Support Vector Machine (ESVM) algorithm using a skewed binary tree. To construct the skewed binary tree, no extra efforts are required as compared to the binary tree approach. The algorithm is tested on the benchmark data sets, and the results are compared with both the multiclass approaches of SVM. The ESVM’s results are compared with five techniques of solving multiple binary SVM classifiers and four techniques of solving a single optimization problem. The comparative experiments prove the efficiency of the ESVM in terms of its accuracy as compared to other contemporary algorithms. Further, ESVM is successfully applied for classification of the email dataset into positive, negative and neutral sentiments.