To solve the multi-class fault diagnosis tasks, decision tree support vector machine （DTSVM）, which combines SVM and decision tree using the concept of dichotomy, is proposed. Since the classification performance of...To solve the multi-class fault diagnosis tasks, decision tree support vector machine （DTSVM）, which combines SVM and decision tree using the concept of dichotomy, is proposed. Since the classification performance of DTSVM highly depends on its structure, to cluster the multi-classes with maximum distance between the clustering centers of the two sub-classes, genetic algorithm is introduced into the formation of decision tree, so that the most separable classes would be separated at each node of decisions tree. Numerical simulations conducted on three datasets compared with ＂one-against-all＂ and ＂one-against-one＂ demonstrate the proposed method has better performance and higher generalization ability than the two conventional methods.展开更多
To make the modulation classification system more suitable for signals in a wide range of signal to noise rate （SNR）, a feature extraction method based on signal wavelet packet transform modulus maxima matrix （WPT...To make the modulation classification system more suitable for signals in a wide range of signal to noise rate （SNR）, a feature extraction method based on signal wavelet packet transform modulus maxima matrix （WPTMMM） and a novel support vector machine fuzzy network （SVMFN） classifier is presented. The WPTMMM feature extraction method has less computational complexity, more stability, and has the preferable advantage of robust with the time parallel moving and white noise. Further, the SVMFN uses a new definition of fuzzy density that incorporates accuracy and uncertainty of the classifiers to improve recognition reliability to classify nine digital modulation types （i.e. 2ASK, 2FSK, 2PSK, 4ASK, 4FSK, 4PSK, 16QAM, MSK, and OQPSK）. Computer simulation shows that the proposed scheme has the advantages of high accuracy and reliability （success rates are over 98% when SNR is not lower than 0dB）, and it adapts to engineering applications.展开更多
A semi-supervised vector machine is a relatively new learning method using both labeled and unlabeled data in classifi- cation. Since the objective function of the model for an unstrained semi-supervised vector machin...A semi-supervised vector machine is a relatively new learning method using both labeled and unlabeled data in classifi- cation. Since the objective function of the model for an unstrained semi-supervised vector machine is not smooth, many fast opti- mization algorithms cannot be applied to solve the model. In order to overcome the difficulty of dealing with non-smooth objective functions, new methods that can solve the semi-supervised vector machine with desired classification accuracy are in great demand. A quintic spline function with three-times differentiability at the ori- gin is constructed by a general three-moment method, which can be used to approximate the symmetric hinge loss function. The approximate accuracy of the quintic spiine function is estimated. Moreover, a quintic spline smooth semi-support vector machine is obtained and the convergence accuracy of the smooth model to the non-smooth one is analyzed. Three experiments are performed to test the efficiency of the model. The experimental results show that the new model outperforms other smooth models, in terms of classification performance. Furthermore, the new model is not sensitive to the increasing number of the labeled samples, which means that the new model is more efficient.展开更多
The support vector machine （SVM） is a novel machine learning method, which has the ability to approximate nonlinear functions with arbitrary accuracy. Setting parameters well is very crucial for SVM learning results...The support vector machine （SVM） is a novel machine learning method, which has the ability to approximate nonlinear functions with arbitrary accuracy. Setting parameters well is very crucial for SVM learning results and generalization ability, and now there is no systematic, general method for parameter selection. In this article, the SVM parameter selection for function approximation is regarded as a compound optimization problem and a mutative scale chaos optimization algorithm is employed to search for optimal paraxneter values. The chaos optimization algorithm is an effective way for global optimal and the mutative scale chaos algorithm could improve the search efficiency and accuracy. Several simulation examples show the sensitivity of the SVM parameters and demonstrate the superiority of this proposed method for nonlinear function approximation.展开更多
According to the chaotic and non-linear characters of power load data,the time series matrix is established with the theory of phase-space reconstruction,and then Lyapunov exponents with chaotic time series are comput...According to the chaotic and non-linear characters of power load data,the time series matrix is established with the theory of phase-space reconstruction,and then Lyapunov exponents with chaotic time series are computed to determine the time delay and the embedding dimension.Due to different features of the data,data mining algorithm is conducted to classify the data into different groups.Redundant information is eliminated by the advantage of data mining technology,and the historical loads that have highly similar features with the forecasting day are searched by the system.As a result,the training data can be decreased and the computing speed can also be improved when constructing support vector machine(SVM) model.Then,SVM algorithm is used to predict power load with parameters that get in pretreatment.In order to prove the effectiveness of the new model,the calculation with data mining SVM algorithm is compared with that of single SVM and back propagation network.It can be seen that the new DSVM algorithm effectively improves the forecast accuracy by 0.75%,1.10% and 1.73% compared with SVM for two random dimensions of 11-dimension,14-dimension and BP network,respectively.This indicates that the DSVM gains perfect improvement effect in the short-term power load forecasting.展开更多
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) for...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.展开更多
A new incremental support vector machine （SVM） algorithm is proposed which is based on multiple kernel learning. Through introducing multiple kernel learning into the SVM incremental learning, large scale data set l...A new incremental support vector machine （SVM） algorithm is proposed which is based on multiple kernel learning. Through introducing multiple kernel learning into the SVM incremental learning, large scale data set learning problem can be solved effectively. Furthermore, different punishments are adopted in allusion to the training subset and the acquired support vectors, which may help to improve the performance of SVM. Simulation results indicate that the proposed algorithm can not only solve the model selection problem in SVM incremental learning, but also improve the classification or prediction precision.展开更多
Vibration-based pavement condition(roughness and obvious anomalies)monitoring has been expanding in road engineering.However,the indistinctive transverse cracking has hardly been considered.Therefore,a vehicle-based n...Vibration-based pavement condition(roughness and obvious anomalies)monitoring has been expanding in road engineering.However,the indistinctive transverse cracking has hardly been considered.Therefore,a vehicle-based novel method is proposed for detecting the transverse cracking through signal processing techniques and support vector machine(SVM).The vibration signals of the car traveling on the transverse-cracked and the crack-free sections were subjected to signal processing in time domain,frequency domain and wavelet domain,aiming to find indices that can discriminate vibration signal between the cracked and uncracked section.These indices were used to form 8 SVM models.The model with the highest accuracy and F1-measure was preferred,consisting of features including vehicle speed,range,relative standard deviation,maximum Fourier coefficient,and wavelet coefficient.Therefore,a crack and crack-free classifier was developed.Then its feasibility was investigated by 2292 pavement sections.The detection accuracy and F1-measure are 97.25%and 85.25%,respectively.The cracking detection approach proposed in this paper and the smartphone-based detection method for IRI and other distress may form a comprehensive pavement condition survey system.展开更多
Support vector machines （SVMs） have been extensively studied and have shown remarkable success in many applications. A new family of twice continuously differentiable piecewise smooth functions are used to smooth th...Support vector machines （SVMs） have been extensively studied and have shown remarkable success in many applications. A new family of twice continuously differentiable piecewise smooth functions are used to smooth the objective function of uncon- strained SVMs. The three-order piecewise smooth support vector machine （TPWSSVMd） is proposed. The piecewise functions can get higher and higher approximation accuracy as required with the increase of parameter d. The global convergence proof of TPWSSVMd is given with the rough set theory. TPWSSVMd can efficiently handle large scale and high dimensional problems. Nu- merical results demonstrate TPWSSVMa has better classification performance and learning efficiency than other competitive base- lines.展开更多
Geomechanical parameters are complex and uncertain.In order to take this complexity and uncertainty into account,a probabilistic back-analysis method combining the Bayesian probability with the least squares support v...Geomechanical parameters are complex and uncertain.In order to take this complexity and uncertainty into account,a probabilistic back-analysis method combining the Bayesian probability with the least squares support vector machine(LS-SVM) technique was proposed.The Bayesian probability was used to deal with the uncertainties in the geomechanical parameters,and an LS-SVM was utilized to establish the relationship between the displacement and the geomechanical parameters.The proposed approach was applied to the geomechanical parameter identification in a slope stability case study which was related to the permanent ship lock within the Three Gorges project in China.The results indicate that the proposed method presents the uncertainties in the geomechanical parameters reasonably well,and also improves the understanding that the monitored information is important in real projects.展开更多
Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while...Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while fixing other components. All components of w update after one iteration. Then go to next iteration. Though the method converges and converges fast in the beginning, it converges slow for final convergence. To improve the speed of final convergence of coordinate descent method, Hooke and Jeeves algorithm which adds pattern search after every iteration in coordinate descent method was applied to SVM and a global Newton algorithm was used to solve one-variable subproblems. We proved the convergence of the algorithm. Experimental results show Hooke and Jeeves＇ method does accelerate convergence specially for final convergence and achieves higher testing accuracy more quickly in classification.展开更多
Rate of penetration(ROP) of a tunnel boring machine(TBM) in a rock environment is generally a key parameter for the successful accomplishment of a tunneling project. The objectives of this work are to compare the accu...Rate of penetration(ROP) of a tunnel boring machine(TBM) in a rock environment is generally a key parameter for the successful accomplishment of a tunneling project. The objectives of this work are to compare the accuracy of prediction models employing partial least squares(PLS) regression and support vector machine(SVM) regression technique for modeling the penetration rate of TBM. To develop the proposed models, the database that is composed of intact rock properties including uniaxial compressive strength(UCS), Brazilian tensile strength(BTS), and peak slope index(PSI), and also rock mass properties including distance between planes of weakness(DPW) and the alpha angle(α) are input as dependent variables and the measured ROP is chosen as an independent variable. Two hundred sets of data are collected from Queens Water Tunnel and Karaj-Tehran water transfer tunnel TBM project. The accuracy of the prediction models is measured by the coefficient of determination(R2) and root mean squares error(RMSE) between predicted and observed yield employing 10-fold cross-validation schemes. The R2 and RMSE of prediction are 0.8183 and 0.1807 for SVMR method, and 0.9999 and 0.0011 for PLS method, respectively. Comparison between the values of statistical parameters reveals the superiority of the PLSR model over SVMR one.展开更多
SVM handles classification problem only considering samples themselves and the classification effect depends on the characteristics of the training samples but not the current information of classified problem.From th...SVM handles classification problem only considering samples themselves and the classification effect depends on the characteristics of the training samples but not the current information of classified problem.From the phenomena of data crossing in systems,this paper improves the classification effect of SVM by adding the prior probability item reflecting the classified problem information into the decision function,which fuses the Bayesian criterion into SVM.The detailed deducing process and realizing steps of the algorithm are put forward.It is verified through two instances.The results showthat the new algorithm has better effect than the traditional SVM algorithm,and its robustness and sensitivity are all improved.展开更多
An adaptive support vector machine decision feedback equalizer（ASVM-DFE） based on the least square support vector machine（LS-SVM） is proposed,it solves linear system iteratively with less computational intensity.A...An adaptive support vector machine decision feedback equalizer（ASVM-DFE） based on the least square support vector machine（LS-SVM） is proposed,it solves linear system iteratively with less computational intensity.An adaptive non-singleton fuzzy support vector machine decision feedback equalizer（ANSFSVMDFE） is also presented,it adopts the non-singleton fuzzy Gaussian kernel function with similar characteristic of pre-filter and is modified with a space transformation based approach.Simulations under nonlinear time variant channels show that ASVM-DFE and ANSFSVM-DFE perform very well on nonlinear equalization and ANSFSVM-DFE acts especially well in resisting abrupt interference.展开更多
To solve the problems of SVM in dealing with large sample size and asymmetric distributed samples, a support vector classification algorithm based on variable parameter linear programming is proposed. In the proposed ...To solve the problems of SVM in dealing with large sample size and asymmetric distributed samples, a support vector classification algorithm based on variable parameter linear programming is proposed. In the proposed algorithm, linear programming is employed to solve the optimization problem of classification to decrease the computation time and to reduce its complexity when compared with the original model. The adjusted punishment parameter greatly reduced the classification error resulting from asymmetric distributed samples and the detailed procedure of the proposed algorithm is given. An experiment is conducted to verify whether the proposed algorithm is suitable for asymmetric distributed samples.展开更多
基金supported by the National Natural Science Foundation of China (60604021 60874054)
文摘To solve the multi-class fault diagnosis tasks, decision tree support vector machine （DTSVM）, which combines SVM and decision tree using the concept of dichotomy, is proposed. Since the classification performance of DTSVM highly depends on its structure, to cluster the multi-classes with maximum distance between the clustering centers of the two sub-classes, genetic algorithm is introduced into the formation of decision tree, so that the most separable classes would be separated at each node of decisions tree. Numerical simulations conducted on three datasets compared with ＂one-against-all＂ and ＂one-against-one＂ demonstrate the proposed method has better performance and higher generalization ability than the two conventional methods.
文摘To make the modulation classification system more suitable for signals in a wide range of signal to noise rate （SNR）, a feature extraction method based on signal wavelet packet transform modulus maxima matrix （WPTMMM） and a novel support vector machine fuzzy network （SVMFN） classifier is presented. The WPTMMM feature extraction method has less computational complexity, more stability, and has the preferable advantage of robust with the time parallel moving and white noise. Further, the SVMFN uses a new definition of fuzzy density that incorporates accuracy and uncertainty of the classifiers to improve recognition reliability to classify nine digital modulation types （i.e. 2ASK, 2FSK, 2PSK, 4ASK, 4FSK, 4PSK, 16QAM, MSK, and OQPSK）. Computer simulation shows that the proposed scheme has the advantages of high accuracy and reliability （success rates are over 98% when SNR is not lower than 0dB）, and it adapts to engineering applications.
基金Supported by National Basic Research Program of China （973 Program） （2005CB321902） National Natural Science Foundation of China （90916024,60727002,60774003）+1 种基金 the Ph.D. Programs Foundation of Ministry of Education of China （20030006003） the Commission on Science,Technology,and Industry for National Defense （A2120061303）
基金supported by the Fundamental Research Funds for University of Science and Technology Beijing(FRF-BR-12-021)
文摘A semi-supervised vector machine is a relatively new learning method using both labeled and unlabeled data in classifi- cation. Since the objective function of the model for an unstrained semi-supervised vector machine is not smooth, many fast opti- mization algorithms cannot be applied to solve the model. In order to overcome the difficulty of dealing with non-smooth objective functions, new methods that can solve the semi-supervised vector machine with desired classification accuracy are in great demand. A quintic spline function with three-times differentiability at the ori- gin is constructed by a general three-moment method, which can be used to approximate the symmetric hinge loss function. The approximate accuracy of the quintic spiine function is estimated. Moreover, a quintic spline smooth semi-support vector machine is obtained and the convergence accuracy of the smooth model to the non-smooth one is analyzed. Three experiments are performed to test the efficiency of the model. The experimental results show that the new model outperforms other smooth models, in terms of classification performance. Furthermore, the new model is not sensitive to the increasing number of the labeled samples, which means that the new model is more efficient.
基金the National Nature Science Foundation of China (60775047, 60402024)
文摘The support vector machine （SVM） is a novel machine learning method, which has the ability to approximate nonlinear functions with arbitrary accuracy. Setting parameters well is very crucial for SVM learning results and generalization ability, and now there is no systematic, general method for parameter selection. In this article, the SVM parameter selection for function approximation is regarded as a compound optimization problem and a mutative scale chaos optimization algorithm is employed to search for optimal paraxneter values. The chaos optimization algorithm is an effective way for global optimal and the mutative scale chaos algorithm could improve the search efficiency and accuracy. Several simulation examples show the sensitivity of the SVM parameters and demonstrate the superiority of this proposed method for nonlinear function approximation.
基金Project(70671039) supported by the National Natural Science Foundation of China
文摘According to the chaotic and non-linear characters of power load data,the time series matrix is established with the theory of phase-space reconstruction,and then Lyapunov exponents with chaotic time series are computed to determine the time delay and the embedding dimension.Due to different features of the data,data mining algorithm is conducted to classify the data into different groups.Redundant information is eliminated by the advantage of data mining technology,and the historical loads that have highly similar features with the forecasting day are searched by the system.As a result,the training data can be decreased and the computing speed can also be improved when constructing support vector machine(SVM) model.Then,SVM algorithm is used to predict power load with parameters that get in pretreatment.In order to prove the effectiveness of the new model,the calculation with data mining SVM algorithm is compared with that of single SVM and back propagation network.It can be seen that the new DSVM algorithm effectively improves the forecast accuracy by 0.75%,1.10% and 1.73% compared with SVM for two random dimensions of 11-dimension,14-dimension and BP network,respectively.This indicates that the DSVM gains perfect improvement effect in the short-term power load forecasting.
基金Project(70572090) supported by the National Natural Science Foundation of China
文摘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.
基金supported by the National Natural Science Key Foundation of China(69974021)
文摘A new incremental support vector machine （SVM） algorithm is proposed which is based on multiple kernel learning. Through introducing multiple kernel learning into the SVM incremental learning, large scale data set learning problem can be solved effectively. Furthermore, different punishments are adopted in allusion to the training subset and the acquired support vectors, which may help to improve the performance of SVM. Simulation results indicate that the proposed algorithm can not only solve the model selection problem in SVM incremental learning, but also improve the classification or prediction precision.
基金Project(51778482)supported by the National Natural Science Foundation of China。
文摘Vibration-based pavement condition(roughness and obvious anomalies)monitoring has been expanding in road engineering.However,the indistinctive transverse cracking has hardly been considered.Therefore,a vehicle-based novel method is proposed for detecting the transverse cracking through signal processing techniques and support vector machine(SVM).The vibration signals of the car traveling on the transverse-cracked and the crack-free sections were subjected to signal processing in time domain,frequency domain and wavelet domain,aiming to find indices that can discriminate vibration signal between the cracked and uncracked section.These indices were used to form 8 SVM models.The model with the highest accuracy and F1-measure was preferred,consisting of features including vehicle speed,range,relative standard deviation,maximum Fourier coefficient,and wavelet coefficient.Therefore,a crack and crack-free classifier was developed.Then its feasibility was investigated by 2292 pavement sections.The detection accuracy and F1-measure are 97.25%and 85.25%,respectively.The cracking detection approach proposed in this paper and the smartphone-based detection method for IRI and other distress may form a comprehensive pavement condition survey system.
基金supported by the National Natural Science Foundation of China(6110016561100231+6 种基金5120530961472307)the Natural Science Foundation of Shaanxi Province(2012JQ80442014JM83132010JQ8004)the Foundation of Education Department of Shaanxi Province(2013JK1096)the New Star Team of Xi’an University of Posts and Telecommunications
文摘Support vector machines （SVMs） have been extensively studied and have shown remarkable success in many applications. A new family of twice continuously differentiable piecewise smooth functions are used to smooth the objective function of uncon- strained SVMs. The three-order piecewise smooth support vector machine （TPWSSVMd） is proposed. The piecewise functions can get higher and higher approximation accuracy as required with the increase of parameter d. The global convergence proof of TPWSSVMd is given with the rough set theory. TPWSSVMd can efficiently handle large scale and high dimensional problems. Nu- merical results demonstrate TPWSSVMa has better classification performance and learning efficiency than other competitive base- lines.
基金Projects(2013BAB02B01,2013BAB02B03)supported by the National Key Technologies R&D Program of ChinaProjects(41072224,41272347)supported by the National Natural Science Foundation of China
文摘Geomechanical parameters are complex and uncertain.In order to take this complexity and uncertainty into account,a probabilistic back-analysis method combining the Bayesian probability with the least squares support vector machine(LS-SVM) technique was proposed.The Bayesian probability was used to deal with the uncertainties in the geomechanical parameters,and an LS-SVM was utilized to establish the relationship between the displacement and the geomechanical parameters.The proposed approach was applied to the geomechanical parameter identification in a slope stability case study which was related to the permanent ship lock within the Three Gorges project in China.The results indicate that the proposed method presents the uncertainties in the geomechanical parameters reasonably well,and also improves the understanding that the monitored information is important in real projects.
基金supported by the National Natural Science Foundation of China (6057407560705004)
文摘Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while fixing other components. All components of w update after one iteration. Then go to next iteration. Though the method converges and converges fast in the beginning, it converges slow for final convergence. To improve the speed of final convergence of coordinate descent method, Hooke and Jeeves algorithm which adds pattern search after every iteration in coordinate descent method was applied to SVM and a global Newton algorithm was used to solve one-variable subproblems. We proved the convergence of the algorithm. Experimental results show Hooke and Jeeves＇ method does accelerate convergence specially for final convergence and achieves higher testing accuracy more quickly in classification.
基金Project(2010CB732004)supported by the National Basic Research Program of ChinaProjects(50934006,41272304)supported by the National Natural Science Foundation of China
文摘Rate of penetration(ROP) of a tunnel boring machine(TBM) in a rock environment is generally a key parameter for the successful accomplishment of a tunneling project. The objectives of this work are to compare the accuracy of prediction models employing partial least squares(PLS) regression and support vector machine(SVM) regression technique for modeling the penetration rate of TBM. To develop the proposed models, the database that is composed of intact rock properties including uniaxial compressive strength(UCS), Brazilian tensile strength(BTS), and peak slope index(PSI), and also rock mass properties including distance between planes of weakness(DPW) and the alpha angle(α) are input as dependent variables and the measured ROP is chosen as an independent variable. Two hundred sets of data are collected from Queens Water Tunnel and Karaj-Tehran water transfer tunnel TBM project. The accuracy of the prediction models is measured by the coefficient of determination(R2) and root mean squares error(RMSE) between predicted and observed yield employing 10-fold cross-validation schemes. The R2 and RMSE of prediction are 0.8183 and 0.1807 for SVMR method, and 0.9999 and 0.0011 for PLS method, respectively. Comparison between the values of statistical parameters reveals the superiority of the PLSR model over SVMR one.
文摘SVM handles classification problem only considering samples themselves and the classification effect depends on the characteristics of the training samples but not the current information of classified problem.From the phenomena of data crossing in systems,this paper improves the classification effect of SVM by adding the prior probability item reflecting the classified problem information into the decision function,which fuses the Bayesian criterion into SVM.The detailed deducing process and realizing steps of the algorithm are put forward.It is verified through two instances.The results showthat the new algorithm has better effect than the traditional SVM algorithm,and its robustness and sensitivity are all improved.
文摘An adaptive support vector machine decision feedback equalizer（ASVM-DFE） based on the least square support vector machine（LS-SVM） is proposed,it solves linear system iteratively with less computational intensity.An adaptive non-singleton fuzzy support vector machine decision feedback equalizer（ANSFSVMDFE） is also presented,it adopts the non-singleton fuzzy Gaussian kernel function with similar characteristic of pre-filter and is modified with a space transformation based approach.Simulations under nonlinear time variant channels show that ASVM-DFE and ANSFSVM-DFE perform very well on nonlinear equalization and ANSFSVM-DFE acts especially well in resisting abrupt interference.
基金the National Natural Science Foundation of China (70471074)China Postdoctoral Science Foundation(2005038042)Department of Science and Technology of Guangdong Province(2004B36001051).
文摘To solve the problems of SVM in dealing with large sample size and asymmetric distributed samples, a support vector classification algorithm based on variable parameter linear programming is proposed. In the proposed algorithm, linear programming is employed to solve the optimization problem of classification to decrease the computation time and to reduce its complexity when compared with the original model. The adjusted punishment parameter greatly reduced the classification error resulting from asymmetric distributed samples and the detailed procedure of the proposed algorithm is given. An experiment is conducted to verify whether the proposed algorithm is suitable for asymmetric distributed samples.
