Robustly stable multi-step-ahead model predictive control (MPC) based on parallel support vector machines (SVMs) with linear kernel was proposed. First, an analytical solution of optimal control laws of parallel SVMs ...Robustly stable multi-step-ahead model predictive control (MPC) based on parallel support vector machines (SVMs) with linear kernel was proposed. First, an analytical solution of optimal control laws of parallel SVMs based MPC was derived, and then the necessary and sufficient stability condition for MPC closed loop was given according to SVM model, and finally a method of judging the discrepancy between SVM model and the actual plant was presented, and consequently the constraint sets, which can guarantee that the stability condition is still robust for model/plant mismatch within some given bounds, were obtained by applying small-gain theorem. Simulation experiments show the proposed stability condition and robust constraint sets can provide a convenient way of adjusting controller parameters to ensure a closed-loop with larger stable margin.展开更多
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 ...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.展开更多
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 i...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.展开更多
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 t...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.展开更多
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 result...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.展开更多
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 speec...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.展开更多
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...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.展开更多
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 Ga...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.展开更多
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 ...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.展开更多
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 cl...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.展开更多
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-...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.展开更多
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...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.展开更多
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 pre...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.展开更多
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 freque...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 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 quickl...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.展开更多
The manuscript presents an augmented Lagrangian—fast projected gradient method (ALFPGM) with an improved scheme of working set selection, pWSS, a decomposition based algorithm for training support vector classificati...The manuscript presents an augmented Lagrangian—fast projected gradient method (ALFPGM) with an improved scheme of working set selection, pWSS, a decomposition based algorithm for training support vector classification machines (SVM). The manuscript describes the ALFPGM algorithm, provides numerical results for training SVM on large data sets, and compares the training times of ALFPGM and Sequential Minimal Minimization algorithms (SMO) from Scikit-learn library. The numerical results demonstrate that ALFPGM with the improved working selection scheme is capable of training SVM with tens of thousands of training examples in a fraction of the training time of some widely adopted SVM tools.展开更多
A new strategy for noise reduction of fast fading channel is presented. Firstly, more information is acquired utilizing the reconstructed embedding phase space. Then, based on the Recurrent Least Squares Sup-port Vect...A new strategy for noise reduction of fast fading channel is presented. Firstly, more information is acquired utilizing the reconstructed embedding phase space. Then, based on the Recurrent Least Squares Sup-port Vector Machines (RLS-SVM), noise reduction of the fast fading channel is realized. This filtering tech-nique does not make use of the spectral contents of the signal. Based on the stability and the fractal of the cha-otic attractor, the RLS-SVM algorithm is a better candidate for the nonlinear time series noise-reduction. The simulation results shows that better noise-reduction performance is acquired when the signal to noise ratio is 12dB.展开更多
In digital fingerprinting, preventing piracy of images by colluders is an important and tedious issue. Each image will be embedded with a unique User IDentification (UID) code that is the fingerprint for tracking the ...In digital fingerprinting, preventing piracy of images by colluders is an important and tedious issue. Each image will be embedded with a unique User IDentification (UID) code that is the fingerprint for tracking the authorized user. The proposed hiding scheme makes use of a random number generator to scramble two copies of a UID, which will then be hidden in the randomly selected medium frequency coefficients of the host image. The linear support vector machine (SVM) will be used to train classifications by calculating the normalized correlation (NC) for the 2-class UID codes. The trained classifications will be the models used for identifying unreadable UID codes. Experimental results showed that the success of predicting the unreadable UID codes can be increased by applying SVM. The proposed scheme can be used to provide protections to intellectual property rights of digital images and to keep track of users to prevent collaborative piracies.展开更多
The Least Squares Support Vector Machines (LS-SVM) is an improvement to the SVM. Combined the LS-SVM with the Multi-Resolution Analysis (MRA),this letter proposes the Multi-resolution LS-SVM (MLS-SVM).The proposed alg...The Least Squares Support Vector Machines (LS-SVM) is an improvement to the SVM. Combined the LS-SVM with the Multi-Resolution Analysis (MRA),this letter proposes the Multi-resolution LS-SVM (MLS-SVM).The proposed algorithm has the same theoretical framework as MRA but with better approximation ability.At a fixed scale MLS-SVM is a classical LS-SVM,but MLS-SVM can gradually approximate the target function at different scales.In experiments,the MLS-SVM is used for nonlinear system identification,and achieves better identification accuracy.展开更多
基金Project(2002CB312200) supported by the National Key Fundamental Research and Development Program of China project(60574019) supported by the National Natural Science Foundation of China
文摘Robustly stable multi-step-ahead model predictive control (MPC) based on parallel support vector machines (SVMs) with linear kernel was proposed. First, an analytical solution of optimal control laws of parallel SVMs based MPC was derived, and then the necessary and sufficient stability condition for MPC closed loop was given according to SVM model, and finally a method of judging the discrepancy between SVM model and the actual plant was presented, and consequently the constraint sets, which can guarantee that the stability condition is still robust for model/plant mismatch within some given bounds, were obtained by applying small-gain theorem. Simulation experiments show the proposed stability condition and robust constraint sets can provide a convenient way of adjusting controller parameters to ensure a closed-loop with larger stable margin.
文摘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.
文摘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.
文摘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.
基金Project supported by the National Basic Research Program (973) of China (No. 2002CB312200) and the Center for Bioinformatics Pro-gram Grant of Harvard Center of Neurodegeneration and Repair,Harvard Medical School, Harvard University, Boston, USA
文摘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.
文摘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.
文摘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.
文摘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.
基金This project is supported by Shanghai Automobile Industry Corporation Technology Foundation, China(No.0224).
文摘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.
基金Project (No. 50437010) supported by the Key Program of the Na-tional Natural Science Foundation of China
文摘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.
文摘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.
文摘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.
文摘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.
基金This work was supportedin part by the National Natural Science Foundation of China(No.60271025,No.30370395)in part by the Science and Technology Depart ment of Shaanxi Province(No.2003K10-G24).
文摘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.
基金National Natural Science Foundation of China (No. 60975083)Key Grant Project,Ministry of Education,China(No. 104145)
文摘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.
文摘The manuscript presents an augmented Lagrangian—fast projected gradient method (ALFPGM) with an improved scheme of working set selection, pWSS, a decomposition based algorithm for training support vector classification machines (SVM). The manuscript describes the ALFPGM algorithm, provides numerical results for training SVM on large data sets, and compares the training times of ALFPGM and Sequential Minimal Minimization algorithms (SMO) from Scikit-learn library. The numerical results demonstrate that ALFPGM with the improved working selection scheme is capable of training SVM with tens of thousands of training examples in a fraction of the training time of some widely adopted SVM tools.
基金Supported by the National Natural Science Foundation of China (No.60102005).
文摘A new strategy for noise reduction of fast fading channel is presented. Firstly, more information is acquired utilizing the reconstructed embedding phase space. Then, based on the Recurrent Least Squares Sup-port Vector Machines (RLS-SVM), noise reduction of the fast fading channel is realized. This filtering tech-nique does not make use of the spectral contents of the signal. Based on the stability and the fractal of the cha-otic attractor, the RLS-SVM algorithm is a better candidate for the nonlinear time series noise-reduction. The simulation results shows that better noise-reduction performance is acquired when the signal to noise ratio is 12dB.
文摘In digital fingerprinting, preventing piracy of images by colluders is an important and tedious issue. Each image will be embedded with a unique User IDentification (UID) code that is the fingerprint for tracking the authorized user. The proposed hiding scheme makes use of a random number generator to scramble two copies of a UID, which will then be hidden in the randomly selected medium frequency coefficients of the host image. The linear support vector machine (SVM) will be used to train classifications by calculating the normalized correlation (NC) for the 2-class UID codes. The trained classifications will be the models used for identifying unreadable UID codes. Experimental results showed that the success of predicting the unreadable UID codes can be increased by applying SVM. The proposed scheme can be used to provide protections to intellectual property rights of digital images and to keep track of users to prevent collaborative piracies.
文摘The Least Squares Support Vector Machines (LS-SVM) is an improvement to the SVM. Combined the LS-SVM with the Multi-Resolution Analysis (MRA),this letter proposes the Multi-resolution LS-SVM (MLS-SVM).The proposed algorithm has the same theoretical framework as MRA but with better approximation ability.At a fixed scale MLS-SVM is a classical LS-SVM,but MLS-SVM can gradually approximate the target function at different scales.In experiments,the MLS-SVM is used for nonlinear system identification,and achieves better identification accuracy.