Intelligent Optimization Methods for High-Dimensional Data Classification for Support Vector Machines

Support vector machine (SVM) is a popular pattern classification method with many application areas. SVM shows its outstanding performance in high-dimensional data classification. In the process of classification, SVM kernel parameter setting during the SVM training procedure, along with the feature selection significantly influences the classification accuracy. This paper proposes two novel intelligent optimization methods, which simultaneously determines the parameter values while discovering a subset of features to increase SVM classification accuracy. The study focuses on two evolutionary computing approaches to optimize the parameters of SVM: particle swarm optimization (PSO) and genetic algorithm (GA). And we combine above the two intelligent optimization methods with SVM to choose appropriate subset features and SVM parameters, which are termed GA-FSSVM (Genetic Algorithm-Feature Selection Support Vector Machines) and PSO-FSSVM(Particle Swarm Optimization-Feature Selection Support Vector Machines) models. Experimental results demonstrate that the classification accuracy by our proposed methods outperforms traditional grid search approach and many other approaches. Moreover, the result indicates that PSO-FSSVM can obtain higher classification accuracy than GA-FSSVM classification for hyperspectral data.

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.

Novel Method of Predicting Network Bandwidth Based on Support Vector Machines

In order to solve the problems of small sample over-fitting and local minima when neural networks learn online, a novel method of predicting network bandwidth based on support vector machines(SVM) is proposed. The prediction and learning online will be completed by the proposed moving window learning algorithm(MWLA). The simulation research is done to validate the proposed method, which is compared with the method based on neural networks.

Krylov Iterative Methods for Support Vector Machines to Classify Galaxy Morphologies

Large catalogues of classified galaxy images have been useful in many studies of the universe in astronomy. There are too many objects to classify manually in the Sloan Digital Sky Survey, one of the premier data sources in astronomy. Therefore, efficient machine learning and classification algorithms are required to automate the classifying process. We propose to apply the Support Vector Machine (SVM) algorithm to classify galaxy morphologies and Krylov iterative methods to improve runtime of the classification. The accuracy of the classification is measured on various categories of galaxies from the survey. A three-class algorithm is presented that makes use of multiple SVMs. This algorithm is used to assign the categories of spiral, elliptical, and irregular galaxies. A selection of Krylov iterative solvers are compared based on their efficiency and accuracy of the resulting classification. The experimental results demonstrate that runtime can be significantly improved by utilizing Krylov iterative methods without impacting classification accuracy. The generalized minimal residual method (GMRES) is shown to be the most efficient solver to classify galaxy morphologies.

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.

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.

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.

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.

Casing life prediction using Borda and support vector machine methods

Eight casing failure modes and 32 risk factors in oil and gas wells are given in this paper. According to the quantitative analysis of the influence degree and occurrence probability of risk factors, the Borda counts for failure modes are obtained with the Borda method. The risk indexes of failure modes are derived from the Borda matrix. Based on the support vector machine （SVM）, a casing life prediction model is established. In the prediction model, eight risk indexes are defined as input vectors and casing life is defined as the output vector. The ideal model parameters are determined with the training set from 19 wells with casing failure. The casing life prediction software is developed with the SVM model as a predictor. The residual life of 60 wells with casing failure is predicted with the software, and then compared with the actual casing life. The comparison results show that the casing life prediction software with the SVM model has high accuracy.

Time-variant reliability analysis of three-dimensional slopes based on Support Vector Machine method

In the reliability analysis of slope, the performance functions derived from the most available stability analysis procedures of slopes are usually implicit and cannot be solved by first-order second-moment approach. A new reliability analysis approach was presented based on three-dimensional Morgenstem-Price method to investigate three-dimensional effect of landslide in stability analyses. To obtain the reliability index, Support Vector Machine （SVM） was applied to approximate the performance function. The time-consuming of this approach is only 0.028% of that using Monte-Carlo method at the same computation accuracy. Also, the influence of time effect of shearing strength parameters of slope soils on the long-term reliability of three-dimensional slopes was investigated by this new approach. It is found that the reliability index of the slope would decrease by 52.54% and the failure probability would increase from 0.000 705% to 1.966%. In the end, the impact of variation coefficients of c andfon reliability index of slopes was taken into discussion and the changing trend was observed.

Classification of power quality combined disturbances based on phase space reconstruction and support vector machines

Power Quality (PQ) combined disturbances become common along with ubiquity of voltage flickers and harmonics. This paper presents a novel approach to classify the different patterns of PQ combined disturbances. The classification system consists of two parts, namely the feature extraction and the automatic recognition. In the feature extraction stage, Phase Space Reconstruction (PSR), a time series analysis tool, is utilized to construct disturbance signal trajectories. For these trajectories, several indices are proposed to form the feature vectors. Support Vector Machines (SVMs) are then implemented to recognize the different patterns and to evaluate the efficiencies. The types of disturbances discussed include a combination of short-term dis-turbances (voltage sags, swells) and long-term disturbances (flickers, harmonics), as well as their homologous single ones. The feasibilities of the proposed approach are verified by simulation with thousands of PQ events. Comparison studies based on Wavelet Transform (WT) and Artificial Neural Network (ANN) are also reported to show its advantages.

Mandarin Digits Speech Recognition Using Support Vector Machines

A method of applying support vector machine (SVM) in speech recognition was proposed, and a speech recognition system for mandarin digits was built up by SVMs. In the system, vectors were linearly extracted from speech feature sequence to make up time-aligned input patterns for SVM, and the decisions of several 2-class SVM classifiers were employed for constructing an N-class classifier. Four kinds of SVM kernel functions were compared in the experiments of speaker-independent speech recognition of mandarin digits. And the kernel of radial basis function has the highest accurate rate of 99.33%, which is better than that of the baseline system based on hidden Markov models (HMM) (97.08%). And the experiments also show that SVM can outperform HMM especially when the samples for learning were very limited.

Modelling of modern automotive petrol engine performance using Support Vector Machines

Modern automotive petrol engine performance is significantly affected by effective tune-up. Current practice of engine tune-up relies on the experience of the automotive engineer, and tune-up is usually done by trial-and-error method and then the vehicle engine is run on the dynamometer to show the actual engine performance. Obviously the current practice involves a large amount of time and money, and then may even fail to tune up the engine optimally because a formal performance model of the engine has not been determined yet. With an emerging technique, Support Vector Machines (SVM), the approximate per- formance model of a petrol vehicle engine can be determined by training the sample engine performance data acquired from the dynamometer. The number of dynamometer tests for an engine tune-up can therefore be reduced because the estimated engine performance model can replace the dynamometer tests to a certain extent. In this paper, the construction, validation and accuracy of the model are discussed. The study showed that the predicted results agree well with the actual test results. To illustrate the significance of the SVM methodology, the results were also compared with that regressed using multilayer feedforward neural networks.

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.

TYRE DYNAMICS MODELLING OF VEHICLE BASED ON SUPPORT VECTOR MACHINES

Various methods of tyre modelling are implemented from pure theoretical to empirical or semi-empirical models based on experimental results. A new way of representing tyre data obtained from measurements is presented via support vector machines （SVMs）. The feasibility of applying SVMs to steady-state tyre modelling is investigated by comparison with three-layer backpropagation （BP） neural network at pure slip and combined slip. The results indicate SVMs outperform the BP neural network in modelling the tyre characteristics with better generalization performance. The SVMsqyre is implemented in 8-DOF vehicle model for vehicle dynamics simulation by means of the PAC 2002 Magic Formula as reference. The SVMs-tyre can be a competitive and accurate method to model a tyre for vehicle dynamics simuLation.

WAVELET KERNEL SUPPORT VECTOR MACHINES FOR SPARSE APPROXIMATION

Wavelet, a powerful tool for signal processing, can be used to approximate the target func-tion. For enhancing the sparse property of wavelet approximation, a new algorithm was proposed by using wavelet kernel Support Vector Machines (SVM), which can converge to minimum error with bet-ter sparsity. Here, wavelet functions would be firstly used to construct the admitted kernel for SVM according to Mercy theory; then new SVM with this kernel can be used to approximate the target fun-citon with better sparsity than wavelet approxiamtion itself. The results obtained by our simulation ex-periment show the feasibility and validity of wavelet kernel support vector machines.

Vibration reliability analysis for aeroengine compressor blade based on support vector machine response surface method

To ameliorate reliability analysis efficiency for aeroengine components, such as compressor blade, support vector machine response surface method(SRSM) is proposed. SRSM integrates the advantages of support vector machine(SVM) and traditional response surface method(RSM), and utilizes experimental samples to construct a suitable response surface function(RSF) to replace the complicated and abstract finite element model. Moreover, the randomness of material parameters, structural dimension and operating condition are considered during extracting data so that the response surface function is more agreeable to the practical model. The results indicate that based on the same experimental data, SRSM has come closer than RSM reliability to approximating Monte Carlo method(MCM); while SRSM(17.296 s) needs far less running time than MCM(10958 s) and RSM(9840 s). Therefore,under the same simulation conditions, SRSM has the largest analysis efficiency, and can be considered a feasible and valid method to analyze structural reliability.

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.

A Kernel Clustering Algorithm for Fast Training of Support Vector Machines

A new algorithm named kernel bisecting k-means and sample removal(KBK-SR) is proposed as sampling preprocessing for support vector machine(SVM) training to improve the efficiency.The proposed algorithm tends to quickly produce balanced clusters of similar sizes in the kernel feature space,which makes it efficient and effective for reducing training samples.Theoretical analysis and experimental results on three UCI real data benchmarks both show that,with very short sampling time,the proposed algorithm dramatically accelerates SVM sampling and training while maintaining high test accuracy.