Multiclass Proximal Support Vector Machines
نویسندگان
چکیده
This article proposes the multiclass proximal support vector machine (MPSVM) classifier, which extends the binary PSVM to the multiclass case. Unlike the one-versus-rest approach that constructs the decision rule based on multiple binary classification tasks, the proposed method considers all classes simultaneously and has better theoretical properties and empirical performance. We formulate the MPSVM as a regularization problem in the reproducing kernel Hilbert space and show that it implements the Bayes rule for classification. In addition, the MPSVM can handle equal and unequal misclassification costs in a unified framework. We suggest an efficient algorithm to implement the MPSVM by solving a system of linear equations. This algorithm requires much less computational effort than solving the standard SVM, which often requires quadratic programming and can be slow for large problems. We also provide an alternative and more robust algorithm for ill-posed problems. The effectiveness of the MPSVM is demonstrated by both simulation studies and applications to cancer classifications using microarray data.
منابع مشابه
Fuzzy Support Vector Machines Based on Density Estimation with Gaussian Mixture for Multiclass Problems
In this paper, we introduce new Fuzzy Support Vector Machines (FSVMs) for a multiclass classification. The suggested Fuzzy Support Vector Machines include the data distribution with the density estimated in a set of functions defined as Gaussian mixture. The proposed method gives more appropriate boundaries than the classical FSVM method. We demonstrate some examples which confirm our approach.
متن کاملMulticlass Support Vector Machines Using Adaptive Directed Acyclic Graph
This paper presents a method of extending Support Vector Machines (SVMs) for dealing with multiclass problems. Motivated by the Decision Directed Acyclic Graph (DDAG), we propose the Adaptive DAG (ADAG): a modified structure of the DDAG that has a lower number of decision levels and reduces the dependency on the sequence of nodes. Thus, the ADAG improves the accuracy of the DDAG while maintaini...
متن کاملA Proximal Approach for Sparse Multiclass SVM
Sparsity-inducing penalties are useful tools to design multiclass support vector machines (SVMs). In this paper, we propose a convex optimization approach for efficiently and exactly solving the multiclass SVM learning problem involving a sparse regularization and the multiclass hinge loss formulated by [1]. We provide two algorithms: the first one dealing with the hinge loss as a penalty term,...
متن کاملIdentifying Efficient Kernel Function in Multiclass Support Vector Machines
Support vector machine (SVM) is a kernel based novel pattern classification method that is significant in many areas like data mining and machine learning. A unique strength is the use of kernel function to map the data into a higher dimensional feature space. In training SVM, kernels and its parameters have very vital role for classification accuracy. Therefore, a suitable kernel design and it...
متن کاملBuilding Fuzzy Classifiers with Pairwise Multiclass Support Vector Machines
In this paper, we make a proposal to build a classifier with fuzzy outputs with multiclass Support Vector Machines (SVMs). This allows us to widen the applicability of this kind of powerful and soundly founded classifiers. We consider the pairwise multiclass version and investigate different alternatives for the aggregation process. A number of experiments have been carried out to establish the...
متن کامل