scholarly journals Parameters Optimization and Application of SVM Based on PCA-Particle Swarm Algorithm

2019 ◽  
pp. 325-330 ◽  
Author(s):  
Qingmi Yang
Keyword(s):  
Parameter Optimization ◽  
Recognition Accuracy ◽  
Recognition Rate ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Principal Component ◽  
Pso Algorithm ◽  
Parameters Optimization ◽  
Support Vector ◽  
Particle Swarm Algorithm

The parameter optimization of Support Vector Machine (SVM) has been a hot research direction. To improve the optimization rate and classification performance of SVM, the Principal Component Analysis (PCA) - Particle Swarm Optimization (PSO) algorithm was used to optimize the penalty parameters and kernel parameters of SVM. PSO which is to find the optimal solution through continuous iteration combined with PCA that eliminates linear redundancy between data, effectively enhance the generalization ability of the model, reduce the optimization time of parameters, and improve the recognition accuracy. The simulation comparison experiments on 6 UCI datasets illustrate that the excellent performance of the PCA-PSO-SVM model. The results show that the proposed algorithm has higher recognition accuracy and better recognition rate than simple PSO algorithm in the parameter optimization of SVM. It is an effective parameter optimization method.

Diagnosis for Vibration Fault of Steam Turbine Based on Modified Particle Swarm Optimization Support Vector Machine

2011 ◽  
Vol 128-129 ◽  
pp. 113-116 ◽  
Author(s):  
Zhi Biao Shi ◽  
Quan Gang Song ◽  
Ming Zhao Ma
Keyword(s):  
Support Vector Machine ◽  
Particle Swarm Optimization ◽  
Fault Diagnosis ◽  
Steam Turbine ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Support Vector ◽  
Particle Swarm Algorithm ◽  
Swarm Optimization ◽  
Modified Particle Swarm Optimization

Due to the influence of artificial factor and slow convergence of particle swarm algorithm (PSO) during parameters selection of support vector machine (SVM), this paper proposes a modified particle swarm optimization support vector machine (MPSO-SVM). A Steam turbine vibration fault diagnosis model was established and the failure data was used in fault diagnosis. The results of application show the model can get automatic optimization about the related parameters of support vector machine and achieve the ideal optimal solution globally. MPSO-SVM strategy is feasible and effective compared with traditional particle swarm optimization support vector machine (PSO-SVM) and genetic algorithm support vector machine (GA-SVM).

scholarly journals Multiple-Fault Diagnosis Method Based on Multiscale Feature Extraction and MSVM_PPA

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Min Zhang ◽  
Zhenyu Cai ◽  
Wenming Cheng
Keyword(s):  
Feature Extraction ◽  
Fault Diagnosis ◽  
Recognition Rate ◽  
Principal Component ◽  
Rolling Bearing ◽  
Total Sample ◽  
Parameters Optimization ◽  
Support Vector ◽  
Significant Information ◽  
Multiple Faults

Identification of rolling bearing fault patterns, especially for the compound faults, has attracted notable attention and is still a challenge in fault diagnosis. In this paper, a novel method called multiscale feature extraction (MFE) and multiclass support vector machine (MSVM) with particle parameter adaptive (PPA) is proposed. MFE is used to preprocess the process signals, which decomposes the data into intrinsic mode function by empirical mode decomposition method, and instantaneous frequency of decomposed components was obtained by Hilbert transformation. Then, statistical features and principal component analysis are utilized to extract significant information from the features, to get effective data from multiple faults. MSVM method with PPA parameters optimization will classify the fault patterns. The results of a case study of the rolling bearings faults data from Case Western Reserve University show that (1) the proposed intelligent method (MFE_PPA_MSVM) improves the classification recognition rate; (2) the accuracy will decline when the number of fault patterns increases; (3) prediction accuracy can be the best when the training set size is increased to 70% of the total sample set. It verifies the method is feasible and efficient for fault diagnosis.

scholarly journals Quantitative and Qualitative Analysis of Multicomponent Gas Using Sensor Array

Sensors ◽  
2019 ◽  
Vol 19 (18) ◽  
pp. 3917 ◽  
Author(s):  
Shurui Fan ◽  
Zirui Li ◽  
Kewen Xia ◽  
Dongxia Hao
Keyword(s):  
Gas Sensor ◽  
Sensor Array ◽  
Recognition Rate ◽  
Principal Component ◽  
High Sensitivity ◽  
Pso Algorithm ◽  
Support Vector ◽  
Gas Sensor Array ◽  
Multicomponent Gas ◽  
Difficult Challenge

The gas sensor array has long been a major tool for measuring gas due to its high sensitivity, quick response, and low power consumption. This goal, however, faces a difficult challenge because of the cross-sensitivity of the gas sensor. This paper presents a novel gas mixture analysis method for gas sensor array applications. The features extracted from the raw data utilizing principal component analysis (PCA) were used to complete random forest (RF) modeling, which enabled qualitative identification. Support vector regression (SVR), optimized by the particle swarm optimization (PSO) algorithm, was used to select hyperparameters C and γ to establish the optimal regression model for the purpose of quantitative analysis. Utilizing the dataset, we evaluated the effectiveness of our approach. Compared with logistic regression (LR) and support vector machine (SVM), the average recognition rate of PCA combined with RF was the highest (97%). The fitting effect of SVR optimized by PSO for gas concentration was better than that of SVR and solved the problem of hyperparameters selection.

Method of Optimization for Target Localization Model Parameters Based on LSSVR

2011 ◽  
Vol 268-270 ◽  
pp. 934-939
Author(s):  
Xue Wen He ◽  
Gui Xiong Liu ◽  
Hai Bing Zhu ◽  
Xiao Ping Zhang
Keyword(s):  
Particle Swarm Optimization ◽  
Fitness Function ◽  
Particle Swarm ◽  
Parameters Optimization ◽  
Target Localization ◽  
Likelihood Method ◽  
Support Vector ◽  
Swarm Optimization ◽  
Localization Accuracy ◽  
Localization Method

Aiming at improving localization accuracy in Wireless Sensor Networks (WSN) based on Least Square Support Vector Regression (LSSVR), making LSSVR localization method more practicable, the mechanism of effects of the kernel function for target localization based on LSSVR is discussed based on the mathematical solution process of LSSVR localization method. A novel method of modeling parameters optimization for LSSVR model using particle swarm optimization is proposed. Construction method of fitness function for modeling parameters optimization is researched. In addition, the characteristics of particle swarm parameters optimization are analyzed. The computational complexity of parameters optimization is taken into consideration comprehensively. Experiments of target localization based on CC2430 show that localization accuracy using LSSVR method with modeling parameters optimization increased by 23%~36% in compare with the maximum likelihood method(MLE) and the localization error is close to the minimum with different LSSVR modeling parameters. Experimental results show that adapting a reasonable fitness function for modeling parameters optimization using particle swarm optimization could enhance the anti-noise ability significantly and improve the LSSVR localization performance.

A Quantum-Behaved Particle Swarm Algorithm Combined with Chaotic Mutation

2012 ◽  
Vol 605-607 ◽  
pp. 2442-2446
Author(s):  
Xin Ran Li ◽  
Yan Xia Jin
Keyword(s):  
Particle Swarm ◽  
Pso Algorithm ◽  
Particle Swarm Algorithm ◽  
Local Optimum ◽  
Convergence Problem ◽  
Early Maturity ◽  
Classical Function ◽  
Function Test ◽  
Quantum Behavior ◽  
Swarm Algorithm

The article puts forward an improved PSO algorithm based on the quantum behavior——CMQPSO algorithm to improve premature convergence problem in particle swarm algorithm. The new algorithm first adopts Tent mapping initialization of particle swarm, searches each particle chaos, and strengthens the diversity of searching. Secondly, a method of effective judgment of early stagnation is embedded in the algorithm. Once the early maturity is retrieved, the algorithm mutates particles to jump out of the local optimum particle according to the structure mutation so as to reduce invalid iteration. The calculation of classical function test shows that the improved algorithm is superior to classical PSO algorithm and quantum-behaved PSO algorithm.

scholarly journals Service Composition in IoT using Genetic algorithm and Particle swarm optimization

2020 ◽  
Vol 10 (1) ◽  
pp. 56-64 ◽  
Author(s):  
Neeti Kashyap ◽  
A. Charan Kumari ◽  
Rita Chhikara
Keyword(s):  
Genetic Algorithm ◽  
Quality Of Service ◽  
Particle Swarm Optimization ◽  
Service Composition ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Critical Issue ◽  
Swarm Optimization

AbstractWeb service compositions are commendable in structuring innovative applications for different Internet-based business solutions. The existing services can be reused by the other applications via the web. Due to the availability of services that can serve similar functionality, suitable Service Composition (SC) is required. There is a set of candidates for each service in SC from which a suitable candidate service is picked based on certain criteria. Quality of service (QoS) is one of the criteria to select the appropriate service. A standout amongst the most important functionality presented by services in the Internet of Things (IoT) based system is the dynamic composability. In this paper, two of the metaheuristic algorithms namely Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are utilized to tackle QoS based service composition issues. QoS has turned into a critical issue in the management of web services because of the immense number of services that furnish similar functionality yet with various characteristics. Quality of service in service composition comprises of different non-functional factors, for example, service cost, execution time, availability, throughput, and reliability. Choosing appropriate SC for IoT based applications in order to optimize the QoS parameters with the fulfillment of user’s necessities has turned into a critical issue that is addressed in this paper. To obtain results via simulation, the PSO algorithm is used to solve the SC problem in IoT. This is further assessed and contrasted with GA. Experimental results demonstrate that GA can enhance the proficiency of solutions for SC problem in IoT. It can also help in identifying the optimal solution and also shows preferable outcomes over PSO.

scholarly journals Research on Recognition Method of Driving Fatigue State Based on Sample Entropy and Kernel Principal Component Analysis

Entropy ◽  
2018 ◽  
Vol 20 (9) ◽  
pp. 701 ◽  
Author(s):  
Beige Ye ◽  
Taorong Qiu ◽  
Xiaoming Bai ◽  
Ping Liu
Keyword(s):  
Principal Component Analysis ◽  
Recognition Accuracy ◽  
Principal Component ◽  
Component Analysis ◽  
Sample Entropy ◽  
Kernel Principal Component Analysis ◽  
Support Vector ◽  
Recognition Method ◽  
State Recognition ◽  
Driving Fatigue

In view of the nonlinear characteristics of electroencephalography (EEG) signals collected in the driving fatigue state recognition research and the issue that the recognition accuracy of the driving fatigue state recognition method based on EEG is still unsatisfactory, this paper proposes a driving fatigue recognition method based on sample entropy (SE) and kernel principal component analysis (KPCA), which combines the advantage of the high recognition accuracy of sample entropy and the advantages of KPCA in dimensionality reduction for nonlinear principal components and the strong non-linear processing capability. By using support vector machine (SVM) classifier, the proposed method (called SE_KPCA) is tested on the EEG data, and compared with those based on fuzzy entropy (FE), combination entropy (CE), three kinds of entropies including SE, FE and CE that merged with KPCA. Experiment results show that the method is effective.

scholarly journals Pressure Prediction of Coal Slurry Transportation Pipeline Based on Particle Swarm Optimization Kernel Function Extreme Learning Machine

2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
Xue-cun Yang ◽  
Xiao-ru Yan ◽  
Chun-feng Song
Keyword(s):  
Support Vector Machine ◽  
Prediction Model ◽  
Extreme Learning Machine ◽  
Kernel Function ◽  
Particle Swarm ◽  
Support Vector ◽  
Particle Swarm Algorithm ◽  
Coal Slurry ◽  
Swarm Optimization ◽  
Learning Machine

For coal slurry pipeline blockage prediction problem, through the analysis of actual scene, it is determined that the pressure prediction from each measuring point is the premise of pipeline blockage prediction. Kernel function of support vector machine is introduced into extreme learning machine, the parameters are optimized by particle swarm algorithm, and blockage prediction method based on particle swarm optimization kernel function extreme learning machine (PSOKELM) is put forward. The actual test data from HuangLing coal gangue power plant are used for simulation experiments and compared with support vector machine prediction model optimized by particle swarm algorithm (PSOSVM) and kernel function extreme learning machine prediction model (KELM). The results prove that mean square error (MSE) for the prediction model based on PSOKELM is 0.0038 and the correlation coefficient is 0.9955, which is superior to prediction model based on PSOSVM in speed and accuracy and superior to KELM prediction model in accuracy.

scholarly journals An Adaptive Genetic Algorithm-based Background Elimination Model for English Text

2021 ◽  
Author(s):  
Tang Xiaohui
Keyword(s):  
Genetic Algorithm ◽  
Feature Extraction ◽  
Differential Evolution ◽  
Recognition Accuracy ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
English Text ◽  
Adaptive Genetic Algorithm ◽  
Feature Sets ◽  
Background Elimination

Abstract In this paper, an adaptive genetic algorithm is used to conduct an in-depth study and analysis of English text background elimination, and a corresponding model is designed. The curve results after the initial character editorialization are curved and transformed, and the adaptive genetic algorithm is used for the transformation to solve the influence of multiple inflection points of curve images on feature extraction. Then, using the minimum deviation method, the error values of the input characters and the sample set in the spatial coordinate system are calculated, and the deviation values of the angle and the straight line are used to match the characters with the smallest deviation value to match the highest degree. A genetic algorithm is introduced to iterate the feature sets of angles and line segments, and the optimal features are finally derived in the process of cross evolution of generations to improve the recognition accuracy. And the character library is used as input items for average grouping for experiments, and the obtained feature sets are put into the position matrix and compared with the samples in the database one by one. It is found that the improved stroke-structure feature extraction algorithm based on a genetic algorithm can improve the recognition accuracy and better accomplish the recognition task with better results compared to others. Finally, by analyzing the limitations and characteristics of traditional particle swarm optimization algorithm and differential evolution algorithm, and giving full play to the advantages and applicability of different algorithms, a new differential evolution particle swarm algorithm with better performance and more stable performance is proposed. The algorithm is based on the PSO algorithm, and when the population update of the PSO algorithm is stagnant and the search space is limited, the crossover and mutation operations of the DE algorithm are used to perturb the population, increase the diversity of the population, and improve the global optimization ability of the algorithm. The algorithm is tested on a common dataset for text mining to verify the effectiveness and feasibility of the algorithm.

Sign in / Sign up

Export Citation Format

Share Document