As the solutions of the least squares support vector regression machine （LS-SVRM） are not sparse, it leads to slow prediction speed and limits its applications. The defects of the ex- isting adaptive pruning algorit...As the solutions of the least squares support vector regression machine （LS-SVRM） are not sparse, it leads to slow prediction speed and limits its applications. The defects of the ex- isting adaptive pruning algorithm for LS-SVRM are that the training speed is slow, and the generalization performance is not satis- factory, especially for large scale problems. Hence an improved algorithm is proposed. In order to accelerate the training speed, the pruned data point and fast leave-one-out error are employed to validate the temporary model obtained after decremental learning. The novel objective function in the termination condition which in- volves the whole constraints generated by all training data points and three pruning strategies are employed to improve the generali- zation performance. The effectiveness of the proposed algorithm is tested on six benchmark datasets. The sparse LS-SVRM model has a faster training speed and better generalization performance.展开更多
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 p...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.展开更多
To overcome the disadvantage that the standard least squares support vector regression(LS-SVR) algorithm is not suitable to multiple-input multiple-output(MIMO) system modelling directly,an improved LS-SVR algorithm w...To overcome the disadvantage that the standard least squares support vector regression(LS-SVR) algorithm is not suitable to multiple-input multiple-output(MIMO) system modelling directly,an improved LS-SVR algorithm which was defined as multi-output least squares support vector regression(MLSSVR) was put forward by adding samples' absolute errors in objective function and applied to flatness intelligent control.To solve the poor-precision problem of the control scheme based on effective matrix in flatness control,the predictive control was introduced into the control system and the effective matrix-predictive flatness control method was proposed by combining the merits of the two methods.Simulation experiment was conducted on 900HC reversible cold roll.The performance of effective matrix method and the effective matrix-predictive control method were compared,and the results demonstrate the validity of the effective matrix-predictive control method.展开更多
Least square support vector regression(LSSVR)is a method for function approximation,whose solutions are typically non-sparse,which limits its application especially in some occasions of fast prediction.In this paper,a...Least square support vector regression(LSSVR)is a method for function approximation,whose solutions are typically non-sparse,which limits its application especially in some occasions of fast prediction.In this paper,a sparse algorithm for adaptive pruning LSSVR algorithm based on global representative point ranking(GRPR-AP-LSSVR)is proposed.At first,the global representative point ranking(GRPR)algorithm is given,and relevant data analysis experiment is implemented which depicts the importance ranking of data points.Furthermore,the pruning strategy of removing two samples in the decremental learning procedure is designed to accelerate the training speed and ensure the sparsity.The removed data points are utilized to test the temporary learning model which ensures the regression accuracy.Finally,the proposed algorithm is verified on artificial datasets and UCI regression datasets,and experimental results indicate that,compared with several benchmark algorithms,the GRPR-AP-LSSVR algorithm has excellent sparsity and prediction speed without impairing the generalization performance.展开更多
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.展开更多
A model of correcting the nonlinear error of photoelectric displacement sensor was established based on the least square support vector machine.The parameters of the correcting nonlinear model,such as penalty factor a...A model of correcting the nonlinear error of photoelectric displacement sensor was established based on the least square support vector machine.The parameters of the correcting nonlinear model,such as penalty factor and kernel parameter,were optimized by chaos genetic algorithm.And the nonlinear correction of photoelectric displacement sensor based on least square support vector machine was applied.The application results reveal that error of photoelectric displacement sensor is less than 1.5%,which is rather satisfactory for nonlinear correction of photoelectric displacement sensor.展开更多
The predictive model of surface roughness of the spiral bevel gear (SBG) tooth based on the least square support vector machine (LSSVM) was proposed.A nonlinear LSSVM model with radial basis function (RBF) kernel was ...The predictive model of surface roughness of the spiral bevel gear (SBG) tooth based on the least square support vector machine (LSSVM) was proposed.A nonlinear LSSVM model with radial basis function (RBF) kernel was presented and then the experimental setup of PECF system was established.The Taguchi method was introduced to assess the effect of finishing parameters on the gear tooth surface roughness,and the training data was also obtained through experiments.The comparison between the predicted values and the experimental values under the same conditions was carried out.The results show that the predicted values are found to be approximately consistent with the experimental values.The mean absolute percent error (MAPE) is 2.43% for the surface roughness and 2.61% for the applied voltage.展开更多
During the Twelfth Five-Year plan,large-scale construction of smart grid with safe and stable operation requires a timely and accurate short-term load forecasting method.Moreover,along with the full-scale smart grid c...During the Twelfth Five-Year plan,large-scale construction of smart grid with safe and stable operation requires a timely and accurate short-term load forecasting method.Moreover,along with the full-scale smart grid construction,the power supply mode and consumption mode of the whole system can be optimized through the accurate short-term load forecasting;and the security,stability and cleanness of the system can be guaranteed.展开更多
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.展开更多
Least squares projection twin support vector machine(LSPTSVM)has faster computing speed than classical least squares support vector machine(LSSVM).However,LSPTSVM is sensitive to outliers and its solution lacks sparsi...Least squares projection twin support vector machine(LSPTSVM)has faster computing speed than classical least squares support vector machine(LSSVM).However,LSPTSVM is sensitive to outliers and its solution lacks sparsity.Therefore,it is difficult for LSPTSVM to process large-scale datasets with outliers.In this paper,we propose a robust LSPTSVM model(called R-LSPTSVM)by applying truncated least squares loss function.The robustness of R-LSPTSVM is proved from a weighted perspective.Furthermore,we obtain the sparse solution of R-LSPTSVM by using the pivoting Cholesky factorization method in primal space.Finally,the sparse R-LSPTSVM algorithm(SR-LSPTSVM)is proposed.Experimental results show that SR-LSPTSVM is insensitive to outliers and can deal with large-scale datasets fastly.展开更多
基金supported by the National Natural Science Foundation of China (61074127)
文摘As the solutions of the least squares support vector regression machine （LS-SVRM） are not sparse, it leads to slow prediction speed and limits its applications. The defects of the ex- isting adaptive pruning algorithm for LS-SVRM are that the training speed is slow, and the generalization performance is not satis- factory, especially for large scale problems. Hence an improved algorithm is proposed. In order to accelerate the training speed, the pruned data point and fast leave-one-out error are employed to validate the temporary model obtained after decremental learning. The novel objective function in the termination condition which in- volves the whole constraints generated by all training data points and three pruning strategies are employed to improve the generali- zation performance. The effectiveness of the proposed algorithm is tested on six benchmark datasets. The sparse LS-SVRM model has a faster training speed and better generalization performance.
基金supported by the National Natural Science Foundation of China(50576033)
文摘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.
基金Supported by the National Creative Research Groups Science Foundation of P.R. China （NCRGSFC： 60421002） and National High Technology Research and Development Program of China （863 Program） （2006AA04 Z182）
基金Project(50675186) supported by the National Natural Science Foundation of China
文摘To overcome the disadvantage that the standard least squares support vector regression(LS-SVR) algorithm is not suitable to multiple-input multiple-output(MIMO) system modelling directly,an improved LS-SVR algorithm which was defined as multi-output least squares support vector regression(MLSSVR) was put forward by adding samples' absolute errors in objective function and applied to flatness intelligent control.To solve the poor-precision problem of the control scheme based on effective matrix in flatness control,the predictive control was introduced into the control system and the effective matrix-predictive flatness control method was proposed by combining the merits of the two methods.Simulation experiment was conducted on 900HC reversible cold roll.The performance of effective matrix method and the effective matrix-predictive control method were compared,and the results demonstrate the validity of the effective matrix-predictive control method.
基金supported by the Science and Technology on Space Intelligent Control Laboratory for National Defense(KGJZDSYS-2018-08)。
文摘Least square support vector regression(LSSVR)is a method for function approximation,whose solutions are typically non-sparse,which limits its application especially in some occasions of fast prediction.In this paper,a sparse algorithm for adaptive pruning LSSVR algorithm based on global representative point ranking(GRPR-AP-LSSVR)is proposed.At first,the global representative point ranking(GRPR)algorithm is given,and relevant data analysis experiment is implemented which depicts the importance ranking of data points.Furthermore,the pruning strategy of removing two samples in the decremental learning procedure is designed to accelerate the training speed and ensure the sparsity.The removed data points are utilized to test the temporary learning model which ensures the regression accuracy.Finally,the proposed algorithm is verified on artificial datasets and UCI regression datasets,and experimental results indicate that,compared with several benchmark algorithms,the GRPR-AP-LSSVR algorithm has excellent sparsity and prediction speed without impairing the generalization performance.
基金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.
基金Project(50925727) supported by the National Fund for Distinguish Young Scholars of ChinaProject(60876022) supported by the National Natural Science Foundation of China+1 种基金Project(2010FJ4141) supported by Hunan Provincial Science and Technology Foundation,ChinaProject supported by the Fund of the Key Construction Academic Subject (Optics) of Hunan Province,China
文摘A model of correcting the nonlinear error of photoelectric displacement sensor was established based on the least square support vector machine.The parameters of the correcting nonlinear model,such as penalty factor and kernel parameter,were optimized by chaos genetic algorithm.And the nonlinear correction of photoelectric displacement sensor based on least square support vector machine was applied.The application results reveal that error of photoelectric displacement sensor is less than 1.5%,which is rather satisfactory for nonlinear correction of photoelectric displacement sensor.
基金Project(90923022) supported by the National Natural Science Foundation of ChinaProject(2009220022) supported by Liaoning Science and Technology Foundation,China
文摘The predictive model of surface roughness of the spiral bevel gear (SBG) tooth based on the least square support vector machine (LSSVM) was proposed.A nonlinear LSSVM model with radial basis function (RBF) kernel was presented and then the experimental setup of PECF system was established.The Taguchi method was introduced to assess the effect of finishing parameters on the gear tooth surface roughness,and the training data was also obtained through experiments.The comparison between the predicted values and the experimental values under the same conditions was carried out.The results show that the predicted values are found to be approximately consistent with the experimental values.The mean absolute percent error (MAPE) is 2.43% for the surface roughness and 2.61% for the applied voltage.
文摘During the Twelfth Five-Year plan,large-scale construction of smart grid with safe and stable operation requires a timely and accurate short-term load forecasting method.Moreover,along with the full-scale smart grid construction,the power supply mode and consumption mode of the whole system can be optimized through the accurate short-term load forecasting;and the security,stability and cleanness of the system can be guaranteed.
基金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(6177202062202433+4 种基金621723716227242262036010)the Natural Science Foundation of Henan Province(22100002)the Postdoctoral Research Grant in Henan Province(202103111)。
文摘Least squares projection twin support vector machine(LSPTSVM)has faster computing speed than classical least squares support vector machine(LSSVM).However,LSPTSVM is sensitive to outliers and its solution lacks sparsity.Therefore,it is difficult for LSPTSVM to process large-scale datasets with outliers.In this paper,we propose a robust LSPTSVM model(called R-LSPTSVM)by applying truncated least squares loss function.The robustness of R-LSPTSVM is proved from a weighted perspective.Furthermore,we obtain the sparse solution of R-LSPTSVM by using the pivoting Cholesky factorization method in primal space.Finally,the sparse R-LSPTSVM algorithm(SR-LSPTSVM)is proposed.Experimental results show that SR-LSPTSVM is insensitive to outliers and can deal with large-scale datasets fastly.
