Functional iterative approaches for solving support vector classification problems based on generalized Huber loss

Over the past decades, 1-norm techniques based on algorithms are widely used to suppress input features. Quite different from traditional 1-norm support vector machine (SVM), direct 1-norm optimization based on the primal problem of nonparallel plane classifiers like generalized proximal support vector machine, twin support vector machine (TWSVM) and least squares twin support vector machine (LSTSVM) are not capable of generating very sparse solutions that are vital for classification and can make them easier to store and faster to compute. To address the issue, in this paper, we develop a feature selection method for LSTSVM, called a feature selection method for nonparallel plane support vector machine classification (FLSTSVM), which is specially designed for strong feature suppression. We incorporate a Tikhonov regularization term to the objective of LSTSVM, and then minimize its 1-norm measure. Solution of FLSTSVM can follow directly from solving two smaller quadratic programming problems (QPPs) arising from two primal QPPs as opposed to two dual ones in TWSVM. FLSTSVM is capable of generating very sparse solutions. This means that FLSTSVM can reduce input features, for the linear case. When a nonlinear classifier is used, few kernel functions determine the classifier. In addition to having strong feature suppression, the edge of our method still lies in its faster computing time compared to that of TWSVM, Newton Method for Linear Programming SVM (NLPSVM) and LPNewton. Lastly, this algorithm is compared on public data sets, as well as an Exclusive Or (XOR) example.

Weighted Twin Support Vector Machines with Local Information and its application

Twin support vector machine (TWSVM) and twin support vector regression (TSVR) are newly emerging efficient machine learning techniques which offer promising solutions for classification and regression challenges respectively. TWSVM is based upon the idea to identify two nonparallel hyperplanes which classify the data points to their respective classes. It requires to solve two small sized quadratic programming problems (QPPs) in lieu of solving single large size QPP in support vector machine (SVM) while TSVR is formulated on the lines of TWSVM and requires to solve two SVM kind problems. Although there has been good research progress on these techniques; there is limited literature on the comparison of different variants of TSVR. Thus, this review presents a rigorous analysis of recent research in TWSVM and TSVR simultaneously mentioning their limitations and advantages. To begin with, we first introduce the basic theory of support vector machine, TWSVM and then focus on the various improvements and applications of TWSVM, and then we introduce TSVR and its various enhancements. Finally, we suggest future research and development prospects.

Least Squares Support Vector Machines (LSSVM) perform classification using L2-norm on the weight vector and a squared loss function with linear constraints. The major advantage over classical L2-norm support vector machine (SVM) is that it solves a system of linear equations rather than solving a quadratic programming problem. The L2-norm penalty on the weight vectors is known to robustly select features. The zero-norm or the number of non-zero elements in a vector is an ideal quantity for feature selection. The L0-norm minimization is a computationally intractable problem. However, a convex relaxation to the direct zero-norm minimization was proposed recently. In this paper, we propose a combination of L2-norm penalty and the convex relaxation of the L0-norm penalty for feature selection in classification problems. We propose a primal-dual framework for feature selection using the combination of L2-norm and L0-norm penalty resulting in closed form solution. A series of experiments on microarray data and UCI data demonstrates that our proposed method results in better performance.

The condition monitoring and fault diagnosis of power transformers plays a significant role in the safe, stable and reliable operation of the whole power system. Dissolved gas analysis (DGA) methods are widely used for fault diagnosis, however, their accuracy is limited by the selection of DGA features and the performance of fault diagnosis models, for example, the classical support vector machine (SVM), is easily affected by unbalanced training samples. This paper presents a transformer fault diagnosis model based on chemical reaction optimization and a twin support vector machine. Twin support vector machines (TWSVMs) are used as classifiers for solving problems involving unbalanced and insufficient samples. Restricted Boltzmann machines (RBMs) are used for data preprocessing to ensure the effective identification of feature parameters and improve the efficiency and accuracy of fault diagnosis. The chemical reaction optimization (CRO) algorithm is used to optimize TWSVM parameters to select the optimal training parameters. The cross-validation (CV) method is used to ensure the reliability and generalization ability of the diagnostic model. Finally, the validity of the model is verified using real fault samples and random testing.

abstractUniversum, a third class not belonging to either class of the classification problem, allows to incorporate the prior knowledge into the learning process. A lot of previous work have demonstrated that the Universum is helpful to the supervised and semi-supervised classification. Moreover, Universum has already been introduced into the support vector machine (SVM) and twin support vector machine (TSVM) to enhance the generalisation performance. To further increase the generalisation performance, we propose a least squares TSVM with Universum data (-TSVM) in this paper. Our -TSVM possesses the following advantages: first, it exploits Universum data to improve generalisation performance. Besides, it implements the structural risk minimisation principle by adding a regularisation to the objective function. Finally, it costs less computing time by solving two small-sized systems of linear equations instead of a single larger-sized quadratic programming problem. To verify the validity of our proposed algorithm, we conduct various experiments around the size of labelled samples and the number of Universum data on data-sets including seven benchmark data-sets, Toy data, MNIST and Face images. Empirical experiments indicate that Universum contributes to making prediction accuracy improved even stable. Especially when fewer labelled samples given, -TSVM is far superior to the improved LS-TSVM (ILS-TSVM), and slightly superior to the -TSVM.

Developing automatic and accurate computer-aided diagnosis (CAD) systems for detecting brain disease in magnetic resonance imaging (MRI) are of great importance in recent years. These systems help the radiologists in accurate interpretation of brain MR images and also substantially reduce the time needed for it. In this paper, a new system for abnormal brain detection is presented. The proposed method employs a multiresolution approach (discrete wavelet transform) to extract features from the MR images. Kernel principal component analysis (KPCA) is harnessed to reduce the dimension of the features, with the goal of obtaining the discriminant features. Subsequently, a new version of support vector machine (SVM) with low computational cost, called least squares SVM (LS-SVM) is utilized to classify brain MR images as normal or abnormal. The proposed scheme is validated on a dataset of 90 images (18 normal and 72 abnormal). A 6-fold stratified cross-validation procedure is implemented and the results of the experiments indicate that the proposed scheme outperforms other competent schemes in terms of classification accuracy with relatively small number of features.

Utilization of SVM, LSSVM and GP for Predicting the Medical Waste Generation

The prediction of wastes generated in the hospital will help their management for several activities like storage, transport and disposing. This chapter adopts Support Vector Machine (SVM), Least Square Support Vector Machine (LSSVM) and Genetic Programming (GP) in order to estimate the rate of medical waste generation. In the event of predicting the rate, type of hospital, capacity and bed occupancy has been used as inputs of SVM, LSSVM and GP. SVM is based on statistical learning theory, which provides an elegant tool for nonlinear system modeling. LSSVM is the re-formulation to the general SVM. GP, a best part of evolutionary algorithm and also the specification of Genetic Algorithm (GA). These SVM, LSSVM and GP have been used as the regression techniques. The results show the performance of the developed SVM, LSSVM and GP models were elegant and outstanding.

The prediction of wastes generated in the hospital will help their management for several activities like storage, transport and disposing. This chapter adopts Support Vector Machine (SVM), Least Square Support Vector Machine (LSSVM) and Genetic Programming (GP) in order to estimate the rate of medical waste generation. In the event of predicting the rate, type of hospital, capacity and bed occupancy has been used as inputs of SVM, LSSVM and GP. SVM is based on statistical learning theory, which provides an elegant tool for nonlinear system modeling. LSSVM is the re-formulation to the general SVM. GP, a best part of evolutionary algorithm and also the specification of Genetic Algorithm (GA). These SVM, LSSVM and GP have been used as the regression techniques. The results show the performance of the developed SVM, LSSVM and GP models were elegant and outstanding.

The minimal complexity support vector machine is a fusion of the support vector machine (SVM) and the minimal complexity machine (MCM), and results in maximizing the minimum margin and minimizing the maximum margin. It works to improve the generalization ability of the L1 SVM (standard SVM) and LP (Linear Programming) SVM. In this paper, we discuss whether it also works for the LS (Least Squares) SVM. The minimal complexity LS SVM (MLS SVM) is trained by minimizing the sum of squared margin errors and minimizing the maximum margin. This results in solving a set of linear equations and a quadratic program, alternatingly. According to the computer experiments for two-class and multiclass problems, the MLS SVM does not outperform the LS SVM for the test data although it does for the cross-validation data.

The traditional vector-based algorithms, such as Support Vector Machine (SVM) and Twin Support Vector Machine (TSVM), have many limitations especially when tensor is considered as input matrix. In this paper, we proposed a novel algorithm with a tensor-based classification paradigm to utilize the structural information. The new proposed algorithm is called  -Twin Support Tensor Machine ( -TSTM), which is an extension of  -Twin Support Vector Machine ( -TSVM). Similarly,  -TSTM solves a pair of smaller-sized Quadratic Programming Problems (QPPs). It reduces the computational complexity substantially. Besides, we formulate  -TSTM, which separates samples in the tensor space with two non-parallel hyperplanes, and the pair of parameters ( ) have theoretical interpretation which are used to control the bounds of the fractions of support tensors and the error margins. What’s more, the structure information of data is retained by the direct use of tensor representation. The proposed  -TSTM can preferably overcome overfitting problem and deal with big data while most vector-based algorithms could hardly compare. In addition, it has better performances on high dimensional and small-sample-size (S3) problem. The efficiency and superiority of the proposed method are demonstrated by experiments on various datasets.

Support vector machine (SVM) has attracted substantial interest in the community of machine learning. As the extension of SVM, nonparallel hyperplane SVM (NHSVM) classification algorithms have become current researching hot spots in machine learning during the last few years. For binary classification tasks, the idea of NHSVM algorithms is to find a hyperplane for each class, such that each hyperplane is proximal to the data points of one class and far from the data points of the other class. Compared with the classical SVM, NHSVM algorithms have lower computational complexity, work better on XOR problems and can get better generalization performance. This paper reviews three representative NHSVM algorithms, including generalized eigenvalue proximal SVM (GEPSVM), twin SVM (TWSVM) and projection twin SVM (PTSVM), and gives the research progress of them. The aim of this overview is to provide an insightful organization of current developments of NHSVM algorithms, identify their limitations and give suggestions for further research.

This article adopts three soft computing techniques including support vector machine (SVM), least square support vector machine (LSSVM) and relevance vector machine (RVM) for prediction of status of epimetemorphic rock slope. The input variables of SVM, LSSVM and RVM are bulk density, height, inclination, cohesion and internal friction angle. There are 53 datasets which have been used to develop the SVM, LSSVM and RVM models. The developed SVM, LSSVM and RVM give equations for prediction of status of epimetemorphic rock slope. The performance of SVM, LSSVM and RVM is 100%. A comparative study has been presented between the developed SVM, LSSVM and RVM. The results confirm that the developed SVM, LSSVM and RVM are effective tools for prediction of status of epimetemorphic rock slope.

The objective of this paper was to determine soluble solids content (SSC) of intact Gannan navel orange by a portable near-infrared (NIR) spectrometer with the optical fiber in the wavelength range of 551~950nm. The effective wavelength regions (EWs) were chosen from the spectra pro-processed by second derivative by interval partial least square (iPLS) and backward interval partial least square (Bipls). Then the partial least square (PLS) and least square support vector machine (LS-SVM) models were developed with EWs. 60 unknown samples were used to evaluate the performance of them. The LS-SVM model was better than others with EWs chosen by Bilps. The correlation coefficient (R) and root mean square error of prediction (RMSEP) for LS-SVM (Bipls) were 0.86 and 0.55°Brix. The results showed that the portable NIR combination with LS-SVM was a feasible method to determine SSC of intact Gannan navel orange nondestructively.