Seasonal Least Squares Support Vector Machine with Fruit Fly Optimization Algorithm in Electricity Consumption Forecasting

Electricity is the guarantee of economic development and daily life. Thus, accurate monthly electricity consumption forecasting can provide reliable guidance for power construction planning. In this paper, a hybrid model in combination of least squares support vector machine(LSSVM) model with fruit fly optimization algorithm(FOA) and the seasonal index adjustment is constructed to predict monthly electricity consumption. The monthly electricity consumption demonstrates a nonlinear characteristic and seasonal tendency. The LSSVM has a good fit for nonlinear data, so it has been widely applied to handling nonlinear time series prediction. However, there is no unified selection method for key parameters and no unified method to deal with the effect of seasonal tendency. Therefore, the FOA was hybridized with the LSSVM and the seasonal index adjustment to solve this problem. In order to evaluate the forecasting performance of hybrid model, two samples of monthly electricity consumption of China and the United States were employed, besides several different models were applied to forecast the two empirical time series. The results of the two samples all show that, for seasonal data, the adjusted model with seasonal indexes has better forecasting performance. The forecasting performance is better than the models without seasonal indexes. The fruit fly optimized LSSVM model outperforms other alternative models. In other words, the proposed hybrid model is a feasible method for the electricity consumption forecasting.

Feature Extraction of Stored-grain Insects Based on Ant Colony Optimization and Support Vector Machine Algorithm

[Objective] The aim was to study the feature extraction of stored-grain insects based on ant colony optimization and support vector machine algorithm, and to explore the feasibility of the feature extraction of stored-grain insects. [Method] Through the analysis of feature extraction in the image recognition of the stored-grain insects, the recognition accuracy of the cross-validation training model in support vector machine （SVM） algorithm was taken as an important factor of the evaluation principle of feature extraction of stored-grain insects. The ant colony optimization （ACO） algorithm was applied to the automatic feature extraction of stored-grain insects. [Result] The algorithm extracted the optimal feature subspace of seven features from the 17 morphological features, including area and perimeter. The ninety image samples of the stored-grain insects were automatically recognized by the optimized SVM classifier, and the recognition accuracy was over 95%. [Conclusion] The experiment shows that the application of ant colony optimization to the feature extraction of grain insects is practical and feasible.

Design of Ballistic Consistency Based on Least Squares Support Vector Machine and Particle Swarm Optimization

In order to improve the firing efficiency of projectiles,it is required to use the universal firing table for gun weapon system equipped with a variety of projectiles.Moreover,the foundation of sharing the universal firing table is the ballistic matching for two types of projectiles.Therefore,a method is proposed in the process of designing new type of projectile.The least squares support vector machine is utilized to build the ballistic trajectory model of the original projectile,thus it is viable to compare the two trajectories.Then the particle swarm optimization is applied to find the combination of trajectory parameters which meet the criterion of ballistic matching best.Finally,examples show the proposed method is valid and feasible.

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.

Predicting of Power Quality Steady State Index Based on Chaotic Theory Using Least Squares Support Vector Machine

An effective power quality prediction for regional power grid can provide valuable references and contribute to the discovering and solving of power quality problems. So a predicting model for power quality steady state index based on chaotic theory and least squares support vector machine (LSSVM) is proposed in this paper. At first, the phase space reconstruction of original power quality data is performed to form a new data space containing the attractor. The new data space is used as training samples for the LSSVM. Then in order to predict power quality steady state index accurately, the particle swarm algorithm is adopted to optimize parameters of the LSSVM model. According to the simulation results based on power quality data measured in a certain distribution network, the model applies to several indexes with higher forecasting accuracy and strong practicability.

Nonlinear model predictive control based on support vector machine and genetic algorithm

This paper presents a nonlinear model predictive control(NMPC) approach based on support vector machine(SVM) and genetic algorithm(GA) for multiple-input multiple-output(MIMO) nonlinear systems.Individual SVM is used to approximate each output of the controlled plant Then the model is used in MPC control scheme to predict the outputs of the controlled plant.The optimal control sequence is calculated using GA with elite preserve strategy.Simulation results of a typical MIMO nonlinear system show that this method has a good ability of set points tracking and disturbance rejection.

Automatic target recognition of moving target based on empirical mode decomposition and genetic algorithm support vector machine

In order to improve measurement accuracy of moving target signals, an automatic target recognition model of moving target signals was established based on empirical mode decomposition(EMD) and support vector machine(SVM). Automatic target recognition process on the nonlinear and non-stationary of Doppler signals of military target by using automatic target recognition model can be expressed as follows. Firstly, the nonlinearity and non-stationary of Doppler signals were decomposed into a set of intrinsic mode functions(IMFs) using EMD. After the Hilbert transform of IMF, the energy ratio of each IMF to the total IMFs can be extracted as the features of military target. Then, the SVM was trained through using the energy ratio to classify the military targets, and genetic algorithm(GA) was used to optimize SVM parameters in the solution space. The experimental results show that this algorithm can achieve the recognition accuracies of 86.15%, 87.93%, and 82.28% for tank, vehicle and soldier, respectively.

Speech Analysis for Diagnosis of Parkinson’s Disease Using Genetic Algorithm and Support Vector Machine

Parkinson’s disease (PD) is the most common disease of motor system degeneration that occurs when the dopamine-producing cells are damaged in substantia nigra. To detect PD, various signals have been investigated, including EEG, gait and speech. Since approximately 90 percent of the people with PD suffer from speech disorders, speech analysis is considered as the most common technique for this aim. This paper proposes a new algorithm for diagnosing of Parkinson’s disease based on voice analysis. In the first step, genetic algorithm (GA) is undertaken for selecting optimized features from all extracted features. Afterwards a network based on support vector machine (SVM) is used for classification between healthy and people with Parkinson. The dataset of this research is composed of a range of biomedical voice signals from 31 people, 23 with Parkinson’s disease and 8 healthy people. The subjects were asked to pronounce letter “A” for 3 seconds. 22 linear and non-linear features were extracted from the signals that 14 features were based on F0 (fundamental frequency or pitch), jitter, shimmer and noise to harmonics ratio, which are main factors in voice signal. Because changing in these factors is noticeable for the people with PD, optimized features were selected among them. Of the various numbers of optimized features, the data classification was investigated. Results show that the classification accuracy percent of 94.50 per 4 optimized features, the accuracy percent of 93.66 per 7 optimized features and the accuracy percent of 94.22 per 9 optimized features, could be achieved. It can be observed that the best classification accuracy may be achieved using Fhi (Hz), Fho (Hz), jitter (RAP) and shimmer (APQ5).

Application of particle swarm optimization-based least square support vector machine in quantitative analysis of extraction solution of yangxinshi tablet using near infrared spectroscopy

A particle swarm optimization(PSO)-based least square support vector machine(LS-SVM)method was investigated for quantitative analysis of extraction solution of Y angxinshi tablet using near infrared(NIR)spectroscopy.The usable spectral region(5400-6200cm^(-1))was identified,then the first derivative spectra smoothed using a Savitzky-Golay filter were employed to establish calibration models.The PSO algorithm was applied to select the LS-SVM hyper-parameters(including the regularization and kernel parametens).The calibration models of total flavonoids,puerarin,salvianolic acid B and icarin were established using the optimumn hyper-parameters of LS SVM.The performance of LS SVM models were compared with partial least squares(PLS)regression,feed forward back propagation network(BPANN)and support vector machine(SVM).Experimental results showed that both the calibration results and prediction accuracy of the PSO-based LS SVM method were superior to PLS,BP-ANN and SVM.For PSO-based LS-SVM models,the determination cofficients(R2)for the calibration set were above 0.9881,and the RSEP values were controlled within 5.772%.For the validation set,the RMSEP values were close to RMSEC and less than 0.042,the RSEP values were under 8.778%,which were much lower than the PLS,BP-ANN and SVM models.The PSO-based LS SVM algorithm employed in this study exhibited excellent calibration performance and prediction accuracy,which has definite practice significance and application value.

Support Vector Machine Ensemble Based on Genetic Algorithm

Support vector machines （SVMs） have been introduced as effective methods for solving classification problems. However, due to some limitations in practical applications, their generalization performance is sometimes far from the expected level. Therefore, it is meaningful to study SVM ensemble learning. In this paper, a novel genetic algorithm based ensemble learning method, namely Direct Genetic Ensemble （DGE）, is proposed. DGE adopts the predictive accuracy of ensemble as the fitness function and searches a good ensemble from the ensemble space. In essence, DGE is also a selective ensemble learning method because the base classifiers of the ensemble are selected according to the solution of genetic algorithm. In comparison with other ensemble learning methods, DGE works on a higher level and is more direct. Different strategies of constructing diverse base classifiers can be utilized in DGE. Experimental results show that SVM ensembles constructed by DGE can achieve better performance than single SVMs, hagged and boosted SVM ensembles. In addition, some valuable conclusions are obtained.

Assessing supply chain performance using genetic algorithm and support vector machine

The rough set-genetic support vector machine(SVM) model is applied to supply chain performance evaluation. First, the rough set theory is used to remove the redundant factors that affect the performance evaluation of supply chain to obtain the core influencing factors. Then the support vector machine is used to extract the core influencing factors to predict the level of supply chain performance. In the process of SVM classification, the genetic algorithm is used to optimize the parameters of the SVM algorithm to obtain the best parameter model, and then the supply chain performance evaluation level is predicted. Finally, an example is used to predict this model, and compared with the result of using only rough set-support vector machine to predict. The results show that the method of rough set-genetic support vector machine can predict the level of supply chain performance more accurately and the prediction result is more realistic, which is a scientific and feasible method.

Parameter selection of support vector regression based on hybrid optimization algorithm and its application

Choosing optimal parameters for support vector regression （SVR） is an important step in SVR. design, which strongly affects the pefformance of SVR. In this paper, based on the analysis of influence of SVR parameters on generalization error, a new approach with two steps is proposed for selecting SVR parameters, First the kernel function and SVM parameters are optimized roughly through genetic algorithm, then the kernel parameter is finely adjusted by local linear search, This approach has been successfully applied to the prediction model of the sulfur content in hot metal. The experiment results show that the proposed approach can yield better generalization performance of SVR than other methods,

A new support vector machine optimized by improved particle swarm optimization and its application

A new support vector machine （SVM） optimized by an improved particle swarm optimization （PSO） combined with simulated annealing algorithm （SA） was proposed. By incorporating with the simulated annealing method, the global searching capacity of the particle swarm optimization（SAPSO） was enchanced, and the searching capacity of the particle swarm optimization was studied. Then, the improyed particle swarm optimization algorithm was used to optimize the parameters of SVM （c,σ and ε）. Based on the operational data provided by a regional power grid in north China, the method was used in the actual short term load forecasting. The results show that compared to the PSO-SVM and the traditional SVM, the average time of the proposed method in the experimental process reduces by 11.6 s and 31.1 s, and the precision of the proposed method increases by 1.24% and 3.18%, respectively. So, the improved method is better than the PSO-SVM and the traditional SVM.

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 Networks to Hybrid Neuro-Genetic SVMs in Portfolio Selection

Corporate net value is efficiently described on its stock price, offering investors a chance to include a potentially surplus value to the net worth of the overall investment portfolio. Financial analysis of corporations extracted from the accounting statements is constantly demanded to support decisions making of portfolio managers. Econometrics and Artificial Intelligence methods aim to extract hidden information from complex accounting and financial data. Support Vector Machines hybrids optimized in their components by Genetic Algorithms provide effective results in corporate financial analysis.

Improved scheme to accelerate sparse least squares support vector regression

The pruning algorithms for sparse least squares support vector regression machine are common methods, and easily com- prehensible, but the computational burden in the training phase is heavy due to the retraining in performing the pruning process, which is not favorable for their applications. To this end, an im- proved scheme is proposed to accelerate sparse least squares support vector regression machine. A major advantage of this new scheme is based on the iterative methodology, which uses the previous training results instead of retraining, and its feasibility is strictly verified theoretically. Finally, experiments on bench- mark data sets corroborate a significant saving of the training time with the same number of support vectors and predictive accuracy compared with the original pruning algorithms, and this speedup scheme is also extended to classification problem.

Hybrid Optimization of Support Vector Machine for Intrusion Detection

Support vector machine (SVM) technique has recently become a research focus in intrusion detection field for its better generalization performance when given less priori knowledge than other soft-computing techniques. But the randomicity of parameter selection in its implement often prevents it achieving expected performance. By utilizing genetic algorithm (GA) to optimize the parameters in data preprocessing and the training model of SVM simultaneously, a hybrid optimization algorithm is proposed in the paper to address this problem. The experimental results demonstrate that it’s an effective method and can improve the performance of SVM-based intrusion detection system further.

A Metamodeling Method Based on Support Vector Regression for Robust Optimization

Metamodeling techniques have been used in robust optimization to reduce the high computational cost of the uncertainty analysis and improve the performance of robust optimization problems with computationally expensive simulation models. Existing metamodels main focus on polynomial regression（PR）, neural networks（NN） and Kriging models, these metamodels are not well suited for large-scale robust optimization problems with small size training sets and high nonlinearity. To address the problem, a reduced approximation model technique based on support vector regression（SVR） is introduced in order to improve the accuracy of metamodels. A robust optimization method based on SVR is presented for problems that involve high dimension and nonlinear. First appropriate design parameter samples are selected by experimental design theories, then the response samples are obtained from the simulations such as finite element analysis, the SVR metamodel is constructed and treated as the mean and the variance of the objective performance functions. Combining other constraints, the robust optimization model is formed which can be solved by genetic algorithm （GA）. The applicability of the method developed is demonstrated using a case of two-bar structure system study. The performances of SVR were compared with those of PR, Kriging and back-propagation neural networks（BPNN）, the comparison results show that the prediction accuracy of the SVR metamodel was higher than those of other metamodels under uncertainty. The robust optimization solutions are near to the real result, and the proposed method is found to be accurate and efficient for robust optimization. This reaserch provides an efficient method for robust optimization problems with complex structure.

Fault Diagnosis Model Based on Fuzzy Support Vector Machine Combined with Weighted Fuzzy Clustering

A fault diagnosis model is proposed based on fuzzy support vector machine (FSVM) combined with fuzzy clustering (FC).Considering the relationship between the sample point and non-self class,FC algorithm is applied to generate fuzzy memberships.In the algorithm,sample weights based on a distribution density function of data point and genetic algorithm (GA) are introduced to enhance the performance of FC.Then a multi-class FSVM with radial basis function kernel is established according to directed acyclic graph algorithm,the penalty factor and kernel parameter of which are optimized by GA.Finally,the model is executed for multi-class fault diagnosis of rolling element bearings.The results show that the presented model achieves high performances both in identifying fault types and fault degrees.The performance comparisons of the presented model with SVM and distance-based FSVM for noisy case demonstrate the capacity of dealing with noise and generalization.

Adjustable entropy function method for support vector machine

Based on KKT complementary condition in optimization theory, an unconstrained non-differential optimization model for support vector machine is proposed. An adjustable entropy function method is given to deal with the proposed optimization problem and the Newton algorithm is used to figure out the optimal solution. The proposed method can find an optimal solution with a relatively small parameter p, which avoids the numerical overflow in the traditional entropy function methods. It is a new approach to solve support vector machine. The theoretical analysis and experimental results illustrate the feasibility and efficiency of the proposed algorithm.