Kernel-based adversarial attacks and defenses on support vector classification

While malicious samples are widely found in many application fields of machine learning,suitable countermeasures have been investigated in the field of adversarial machine learning.Due to the importance and popularity of Support Vector Machines(SVMs),we first describe the evasion attack against SVM classification and then propose a defense strategy in this paper.The evasion attack utilizes the classification surface of SVM to iteratively find the minimal perturbations that mislead the nonlinear classifier.Specially,we propose what is called a vulnerability function to measure the vulnerability of the SVM classifiers.Utilizing this vulnerability function,we put forward an effective defense strategy based on the kernel optimization of SVMs with Gaussian kernel against the evasion attack.Our defense method is verified to be very effective on the benchmark datasets,and the SVM classifier becomes more robust after using our kernel optimization scheme.

Application of Particle Swarm Optimization to Fault Condition Recognition Based on Kernel Principal Component Analysis

Panicle swarm optimization （PSO） is an optimization algorithm based on the swarm intelligent principle. In this paper the modified PSO is applied to a kernel principal component analysis （ KPCA ） for an optimal kernel function parameter. We first comprehensively considered within-class scatter and between-class scatter of the sample features. Then, the fitness function of an optimized kernel function parameter is constructed, and the particle swarm optimization algorithm with adaptive acceleration （CPSO） is applied to optimizing it. It is used for gearbox condi- tion recognition, and the result is compared with the recognized results based on principal component analysis （PCA）. The results show that KPCA optimized by CPSO can effectively recognize fault conditions of the gearbox by reducing bind set-up of the kernel function parameter, and its results of fault recognition outperform those of PCA. We draw the conclusion that KPCA based on CPSO has an advantage in nonlinear feature extraction of mechanical failure, and is helpful for fault condition recognition of complicated machines.

Boosting Kernel Search Optimizer with Slime Mould Foraging Behavior for Combined Economic Emission Dispatch Problems

Reducing pollutant emissions from electricity production in the power system positively impacts the control of greenhouse gas emissions.Boosting kernel search optimizer(BKSO)is introduced in this research to solve the combined economic emission dispatch(CEED)problem.Inspired by the foraging behavior in the slime mould algorithm(SMA),the kernel matrix of the kernel search optimizer(KSO)is intensified.The proposed BKSO is superior to the standard KSO in terms of exploitation ability,robustness,and convergence rate.The CEC2013 test function is used to assess the improved KSO's performance and compared to 11 well-known optimization algorithms.BKSO performs better in statistical results and convergence curves.At the same time,BKSO achieves better fuel costs and fewer pollution emissions by testing with four real CEED cases,and the Pareto solution obtained is also better than other MAs.Based on the experimental results,BKSO has better performance than other comparable MAs and can provide more economical,robust,and cleaner solutions to CEED problems.

Extremal optimization for optimizing kernel function and its parameters in support vector regression

The performance of the support vector regression (SVR) model is sensitive to the kernel type and its parameters.The determination of an appropriate kernel type and the associated parameters for SVR is a challenging research topic in the field of support vector learning.In this study,we present a novel method for simultaneous optimization of the SVR kernel function and its parameters,formulated as a mixed integer optimization problem and solved using the recently proposed heuristic 'extremal optimization (EO)'.We present the problem formulation for the optimization of the SVR kernel and parameters,the EO-SVR algorithm,and experimental tests with five benchmark regression problems.The results of comparison with other traditional approaches show that the proposed EO-SVR method provides better generalization performance by successfully identifying the optimal SVR kernel function and its parameters.

Novel Model Using Kernel Function and Local Intensity Information for Noise Image Segmentation

It remains a challenging task to segment images that are distorted by noise and intensity inhomogeneity.To overcome these problems, in this paper, we present a novel region-based active contour model based on local intensity information and a kernel metric. By introducing intensity information about the local region, the proposed model can accurately segment images with intensity inhomogeneity. To enhance the model＇s robustness to noise and outliers, we introduce a kernel metric as its objective functional. To more accurately detect boundaries, we apply convex optimization to this new model, which uses a weighted total-variation norm given by an edge indicator function. Lastly, we use the split Bregman iteration method to obtain the numerical solution. We conducted an extensive series of experiments on both synthetic and real images to evaluate our proposed method, and the results demonstrate significant improvements in terms of efficiency and accuracy, compared with the performance of currently popular methods.

OKO-SVM:Online kernel optimization-based support vector machine for the incremental learning and classification of the sentiments in the train reviews

Online incremental learning is one of the emerging research interests among the researchers in the recent years.The sentiment classification through the online incremental learning faces many challenges due to the limitations in the memory and the computing resources available for processing the online reviews.This work has introduced an online incremental learning algorithm for classifying the train reviews.The sentiments available in the reviews provided for the public services are necessary for improving the quality of the service.This work proposes the online kernel optimizationbased support vector machine(OKO-SVM)classifier for the sentiment classification of the train reviews.This paper is the extension of the previous work kernel optimizationbased support vector machine(KO-SVM).The OKO-SVM classifier uses the proposed fuzzy bound for modifying the weight for each incoming review database for the particular time duration.The simulation uses the standard train review and the movie review database for the classification.From the simulation results,it is evident that the proposed model has achieved a better performance with the values of 84.42%,93.86%,and 74.56%regarding the accuracy,sensitivity,and specificity while classifying the train review database.

Kernel Function-Based Primal-Dual Interior-Point Methods for Symmetric Cones Optimization

In this paper, we present a large-update primal-dual interior-point method for symmetric cone optimization（SCO） based on a new kernel function, which determines both search directions and the proximity measure between the iterate and the center path. The kernel function is neither a self-regular function nor the usual logarithmic kernel function. Besides, by using Euclidean Jordan algebraic techniques, we achieve the favorable iteration complexity O（ √r（1/2）（log r）^2 log（r/ ε））, which is as good as the convex quadratic semi-definite optimization analogue.