Machine learning model based on non-convex penalized huberized-SVM

The support vector machine(SVM)is a classical machine learning method.Both the hinge loss and least absolute shrinkage and selection operator(LASSO)penalty are usually used in traditional SVMs.However,the hinge loss is not differentiable,and the LASSO penalty does not have the Oracle property.In this paper,the huberized loss is combined with non-convex penalties to obtain a model that has the advantages of both the computational simplicity and the Oracle property,contributing to higher accuracy than traditional SVMs.It is experimentally demonstrated that the two non-convex huberized-SVM methods,smoothly clipped absolute deviation huberized-SVM(SCAD-HSVM)and minimax concave penalty huberized-SVM(MCP-HSVM),outperform the traditional SVM method in terms of the prediction accuracy and classifier performance.They are also superior in terms of variable selection,especially when there is a high linear correlation between the variables.When they are applied to the prediction of listed companies,the variables that can affect and predict financial distress are accurately filtered out.Among all the indicators,the indicators per share have the greatest influence while those of solvency have the weakest influence.Listed companies can assess the financial situation with the indicators screened by our algorithm and make an early warning of their possible financial distress in advance with higher precision.

Facial Expression Recognition Model Depending on Optimized Support Vector Machine

In computer vision,emotion recognition using facial expression images is considered an important research issue.Deep learning advances in recent years have aided in attaining improved results in this issue.According to recent studies,multiple facial expressions may be included in facial photographs representing a particular type of emotion.It is feasible and useful to convert face photos into collections of visual words and carry out global expression recognition.The main contribution of this paper is to propose a facial expression recognitionmodel(FERM)depending on an optimized Support Vector Machine(SVM).To test the performance of the proposed model(FERM),AffectNet is used.AffectNet uses 1250 emotion-related keywords in six different languages to search three major search engines and get over 1,000,000 facial photos online.The FERM is composed of three main phases:(i)the Data preparation phase,(ii)Applying grid search for optimization,and(iii)the categorization phase.Linear discriminant analysis(LDA)is used to categorize the data into eight labels(neutral,happy,sad,surprised,fear,disgust,angry,and contempt).Due to using LDA,the performance of categorization via SVM has been obviously enhanced.Grid search is used to find the optimal values for hyperparameters of SVM(C and gamma).The proposed optimized SVM algorithm has achieved an accuracy of 99%and a 98%F1 score.

POSITIVE DEFINITE KERNEL IN SUPPORT VECTOR MACHINE(SVM)

The relationship among Mercer kernel, reproducing kernel and positive definite kernel in support vector machine （SVM） is proved and their roles in SVM are discussed. The quadratic form of the kernel matrix is used to confirm the positive definiteness and their construction. Based on the Bochner theorem, some translation invariant kernels are checked in their Fourier domain. Some rotation invariant radial kernels are inspected according to the Schoenberg theorem. Finally, the construction of discrete scaling and wavelet kernels, the kernel selection and the kernel parameter learning are discussed.

Support Vector Machines for Regression: A Succinct Review of Large-Scale and Linear Programming Formulations

Support Vector-based learning methods are an important part of Computational Intelligence techniques. Recent efforts have been dealing with the problem of learning from very large datasets. This paper reviews the most commonly used formulations of support vector machines for regression (SVRs) aiming to emphasize its usability on large-scale applications. We review the general concept of support vector machines (SVMs), address the state-of-the-art on training methods SVMs, and explain the fundamental principle of SVRs. The most common learning methods for SVRs are introduced and linear programming-based SVR formulations are explained emphasizing its suitability for large-scale learning. Finally, this paper also discusses some open problems and current trends.

An Efficient and Robust Fall Detection System Using Wireless Gait Analysis Sensor with Artificial Neural Network (ANN) and Support Vector Machine (SVM) Algorithms

In this work, a total of 322 tests were taken on young volunteers by performing 10 different falls, 6 different Activities of Daily Living (ADL) and 7 Dynamic Gait Index (DGI) tests using a custom-designed Wireless Gait Analysis Sensor (WGAS). In order to perform automatic fall detection, we used Back Propagation Artificial Neural Network (BP-ANN) and Support Vector Machine (SVM) based on the 6 features extracted from the raw data. The WGAS, which includes a tri-axial accelerometer, 2 gyroscopes, and a MSP430 microcontroller, is worn by the subjects at either T4 (at back) or as a belt-clip in front of the waist during the various tests. The raw data is wirelessly transmitted from the WGAS to a near-by PC for real-time fall classification. The BP ANN is optimized by varying the training, testing and validation data sets and training the network with different learning schemes. SVM is optimized by using three different kernels and selecting the kernel for best classification rate. The overall accuracy of BP ANN is obtained as 98.20% with LM and RPROP training from the T4 data, while from the data taken at the belt, we achieved 98.70% with LM and SCG learning. The overall accuracy using SVM was 98.80% and 98.71% with RBF kernel from the T4 and belt position data, respectively.

Support Vector Machines(SVM)-Markov Chain Prediction Model of Mining Water Inflow

This study was conducted to establish a Support Vector Machines(SVM)-Markov Chain prediction model for prediction of mining water inflow. According to the raw data sequence, the Support Vector Machines(SVM) model was built, and then revised by means of a Markov state change probability matrix. Through dividing the state and analyzing absolute errors and relative errors and other indexes of the measured value and the fitted value of SVM, the prediction results were improved. Finally,the model was used to calculate relative errors. Through predicting and analyzing mining water inflow, the prediction results of the model were satisfactory. The results of this study enlarge the application scope of the Support Vector Machines(SVM) prediction model and provide a new method for scientific forecasting water inflow in coal mining.

Support vector machines approach to mean particle size of rock fragmentation due to bench blasting prediction

Aiming at the problems of the traditional method of assessing distribution of particle size in bench blasting, a support vector machines （SVMs） regression methodology was used to predict the mean particle size （X50） resulting from rock blast fragmentation in various mines based on the statistical learning theory. The data base consisted of blast design parameters, explosive parameters, modulus of elasticity and in-situ block size. The seven input independent variables used for the SVMs model for the prediction of X50 of rock blast fragmentation were the ratio of bench height to drilled burden （H/B）, ratio of spacing to burden （S/B）, ratio of burden to hole diameter （B/D）, ratio of stemming to burden （T/B）, powder factor （Pf）, modulus of elasticity （E） and in-situ block size （XB）. After using the 90 sets of the measured data in various mines and rock formations in the world for training and testing, the model was applied to 12 another blast data for validation of the trained support vector regression （SVR） model. The prediction results of SVR were compared with those of artificial neural network （ANN）, multivariate regression analysis （MVRA） models, conventional Kuznetsov method and the measured X50 values. The proposed method shows promising results and the prediction accuracy of SVMs model is acceptable.

Multiple mental tasks classification based on nonlinear parameter of mean period using support vector machines

Mental task classification is one of the most important problems in Brain-computer interface.This paper studies the classification of five-class mental tasks.The nonlinear parameter of mean period obtained from frequency domain information was used as features for classification implemented by using the method of SVM(support vector machines).The averaged classification accuracy of 85.6% over 7 subjects was achieved for 2-second EEG segments.And the results for EEG segments of 0.5s and 5.0s compared favorably to those of Garrett's.The results indicate that the parameter of mean period represents mental tasks well for classification.Furthermore,the method of mean period is less computationally demanding,which indicates its potential use for online BCI systems.

Parameter selection of support vector machine for function approximation based on chaos optimization

The support vector machine （SVM） is a novel machine learning method, which has the ability to approximate nonlinear functions with arbitrary accuracy. Setting parameters well is very crucial for SVM learning results and generalization ability, and now there is no systematic, general method for parameter selection. In this article, the SVM parameter selection for function approximation is regarded as a compound optimization problem and a mutative scale chaos optimization algorithm is employed to search for optimal paraxneter values. The chaos optimization algorithm is an effective way for global optimal and the mutative scale chaos algorithm could improve the search efficiency and accuracy. Several simulation examples show the sensitivity of the SVM parameters and demonstrate the superiority of this proposed method for nonlinear function approximation.

Parameters selection in gene selection using Gaussian kernel support vector machines by genetic algorithm

In microarray-based cancer classification, gene selection is an important issue owing to the large number of variables and small number of samples as well as its non-linearity. It is difficult to get satisfying results by using conventional linear sta- tistical methods. Recursive feature elimination based on support vector machine (SVM RFE) is an effective algorithm for gene selection and cancer classification, which are integrated into a consistent framework. In this paper, we propose a new method to select parameters of the aforementioned algorithm implemented with Gaussian kernel SVMs as better alternatives to the common practice of selecting the apparently best parameters by using a genetic algorithm to search for a couple of optimal parameter. Fast implementation issues for this method are also discussed for pragmatic reasons. The proposed method was tested on two repre- sentative hereditary breast cancer and acute leukaemia datasets. The experimental results indicate that the proposed method per- forms well in selecting genes and achieves high classification accuracies with these genes.

Decision tree support vector machine based on genetic algorithm for multi-class classification

To solve the multi-class fault diagnosis tasks, decision tree support vector machine （DTSVM）, which combines SVM and decision tree using the concept of dichotomy, is proposed. Since the classification performance of DTSVM highly depends on its structure, to cluster the multi-classes with maximum distance between the clustering centers of the two sub-classes, genetic algorithm is introduced into the formation of decision tree, so that the most separable classes would be separated at each node of decisions tree. Numerical simulations conducted on three datasets compared with ＂one-against-all＂ and ＂one-against-one＂ demonstrate the proposed method has better performance and higher generalization ability than the two conventional methods.

Debris Flow Hazard Assessment Based on Support Vector Machine

Seven factors, including the maximum volume of once flow , occurrence frequency of debris flow , watershed area , main channel length , watershed relative height difference , valley incision density and the length ratio of sediment supplement are chosen as evaluation factors of debris flow hazard degree. Using support vector machine （SVM） theory, we selected 259 basic data of 37 debris flow channels in Yunnan Province as learning samples in this study. We create a debris flow hazard assessment model based on SVM. The model was validated though instance applications and showed encouraging results.

Laser-induced breakdown spectroscopy applied to the characterization of rock by support vector machine combined with principal component analysis

Laser-induced breakdown spectroscopy（LIBS） is a versatile tool for both qualitative and quantitative analysis.In this paper,LIBS combined with principal component analysis（PCA） and support vector machine（SVM） is applied to rock analysis.Fourteen emission lines including Fe,Mg,Ca,Al,Si,and Ti are selected as analysis lines.A good accuracy（91.38% for the real rock） is achieved by using SVM to analyze the spectroscopic peak area data which are processed by PCA.It can not only reduce the noise and dimensionality which contributes to improving the efficiency of the program,but also solve the problem of linear inseparability by combining PCA and SVM.By this method,the ability of LIBS to classify rock is validated.

Support vector machine forecasting method improved by chaotic particle swarm optimization and its application

By adopting the chaotic searching to improve the global searching performance of the particle swarm optimization (PSO), and using the improved PSO to optimize the key parameters of the support vector machine (SVM) forecasting model, an improved SVM model named CPSO-SVM model was proposed. The new model was applied to predicting the short term load, and the improved effect of the new model was proved. The simulation results of the South China Power Market’s actual data show that the new method can effectively improve the forecast accuracy by 2.23% and 3.87%, respectively, compared with the PSO-SVM and SVM methods. Compared with that of the PSO-SVM and SVM methods, the time cost of the new model is only increased by 3.15 and 4.61 s, respectively, which indicates that the CPSO-SVM model gains significant improved effects.

Optimization of support vector machine power load forecasting model based on data mining and Lyapunov exponents

According to the chaotic and non-linear characters of power load data,the time series matrix is established with the theory of phase-space reconstruction,and then Lyapunov exponents with chaotic time series are computed to determine the time delay and the embedding dimension.Due to different features of the data,data mining algorithm is conducted to classify the data into different groups.Redundant information is eliminated by the advantage of data mining technology,and the historical loads that have highly similar features with the forecasting day are searched by the system.As a result,the training data can be decreased and the computing speed can also be improved when constructing support vector machine(SVM) model.Then,SVM algorithm is used to predict power load with parameters that get in pretreatment.In order to prove the effectiveness of the new model,the calculation with data mining SVM algorithm is compared with that of single SVM and back propagation network.It can be seen that the new DSVM algorithm effectively improves the forecast accuracy by 0.75%,1.10% and 1.73% compared with SVM for two random dimensions of 11-dimension,14-dimension and BP network,respectively.This indicates that the DSVM gains perfect improvement effect in the short-term power load forecasting.

Support Vector Machine active learning for 3D model retrieval

In this paper, we present a novel Support Vector Machine active learning algorithm for effective 3D model retrieval using the concept of relevance feedback. The proposed method learns from the most informative objects which are marked by the user, and then creates a boundary separating the relevant models from irrelevant ones. What it needs is only a small number of 3D models labelled by the user. It can grasp the user＇s semantic knowledge rapidly and accurately. Experimental results showed that the proposed algorithm significantly improves the retrieval effectiveness. Compared with four state-of-the-art query refinement schemes for 3D model retrieval, it provides superior retrieval performance after no more than two rounds of relevance feedback.

A Real-Time and Ubiquitous Network Attack Detection Based on Deep Belief Network and Support Vector Machine

In recent years, network traffic data have become larger and more complex, leading to higher possibilities of network intrusion. Traditional intrusion detection methods face difficulty in processing high-speed network data and cannot detect currently unknown attacks. Therefore, this paper proposes a network attack detection method combining a flow calculation and deep learning. The method consists of two parts: a real-time detection algorithm based on flow calculations and frequent patterns and a classification algorithm based on the deep belief network and support vector machine(DBN-SVM). Sliding window(SW) stream data processing enables real-time detection, and the DBN-SVM algorithm can improve classification accuracy. Finally, to verify the proposed method, a system is implemented.Based on the CICIDS2017 open source data set, a series of comparative experiments are conducted. The method's real-time detection efficiency is higher than that of traditional machine learning algorithms. The attack classification accuracy is 0.7 percentage points higher than that of a DBN, which is 2 percentage points higher than that of the integrated algorithm boosting and bagging methods. Hence, it is suitable for the real-time detection of high-speed network intrusions.

SENSITIVITY ANALYSIS FOR ROLLING PROCESS BASED ON SUPPORT VECTOR MACHINE

A method for the calculation of the sensitivity factors of the rollingprocess has been obtained by differentiating the roll force model based on support vector machine.It can eliminate the algebraic loop of the analytical model of the rolling process. The simulationsin the first stand of five stand cold tandem rolling mill indicate that the calculation forsensitivities by this proposed method can obtain a good accuracy, and an appropriate adjustment onthe control variables determined directly by the sensitivity has an excellent compensation accuracy.Moreover, the roll gap has larger effect on the exit thickness than both front tension and backtension, and it is more efficient to select the roll gap as the control variable of the thicknesscontrol system in the first stand.

Incremental support vector machine algorithm based on multi-kernel learning

A new incremental support vector machine （SVM） algorithm is proposed which is based on multiple kernel learning. Through introducing multiple kernel learning into the SVM incremental learning, large scale data set learning problem can be solved effectively. Furthermore, different punishments are adopted in allusion to the training subset and the acquired support vectors, which may help to improve the performance of SVM. Simulation results indicate that the proposed algorithm can not only solve the model selection problem in SVM incremental learning, but also improve the classification or prediction precision.

New family of piecewise smooth support vector machine

Support vector machines （SVMs） have been extensively studied and have shown remarkable success in many applications. A new family of twice continuously differentiable piecewise smooth functions are used to smooth the objective function of uncon- strained SVMs. The three-order piecewise smooth support vector machine （TPWSSVMd） is proposed. The piecewise functions can get higher and higher approximation accuracy as required with the increase of parameter d. The global convergence proof of TPWSSVMd is given with the rough set theory. TPWSSVMd can efficiently handle large scale and high dimensional problems. Nu- merical results demonstrate TPWSSVMa has better classification performance and learning efficiency than other competitive base- lines.