The advantages of genome selection(GS) in animal and plant breeding are self-evident.Traditional parametric models have disadvantage in better fit the increasingly large sequencing data and capture complex effects acc...The advantages of genome selection(GS) in animal and plant breeding are self-evident.Traditional parametric models have disadvantage in better fit the increasingly large sequencing data and capture complex effects accurately.Machine learning models have demonstrated remarkable potential in addressing these challenges.In this study,we introduced the concept of mixed kernel functions to explore the performance of support vector machine regression(SVR) in GS.Six single kernel functions(SVR_L,SVR_C,SVR_G,SVR_P,SVR_S,SVR_L) and four mixed kernel functions(SVR_GS,SVR_GP,SVR_LS,SVR_LP) were used to predict genome breeding values.The prediction accuracy,mean squared error(MSE) and mean absolute error(MAE) were used as evaluation indicators to compare with two traditional parametric models(GBLUP,BayesB) and two popular machine learning models(RF,KcRR).The results indicate that in most cases,the performance of the mixed kernel function model significantly outperforms that of GBLUP,BayesB and single kernel function.For instance,for T1 in the pig dataset,the predictive accuracy of SVR_GS is improved by 10% compared to GBLUP,and by approximately 4.4 and 18.6% compared to SVR_G and SVR_S respectively.For E1 in the wheat dataset,SVR_GS achieves 13.3% higher prediction accuracy than GBLUP.Among single kernel functions,the Laplacian and Gaussian kernel functions yield similar results,with the Gaussian kernel function performing better.The mixed kernel function notably reduces the MSE and MAE when compared to all single kernel functions.Furthermore,regarding runtime,SVR_GS and SVR_GP mixed kernel functions run approximately three times faster than GBLUP in the pig dataset,with only a slight increase in runtime compared to the single kernel function model.In summary,the mixed kernel function model of SVR demonstrates speed and accuracy competitiveness,and the model such as SVR_GS has important application potential for GS.展开更多
The state of health SoH of lithium ion batteries plays a predominant role in ensuring the safe and reliable operation of electric vehicles.In this,a novel SoH estimation approach using support vector regression with a...The state of health SoH of lithium ion batteries plays a predominant role in ensuring the safe and reliable operation of electric vehicles.In this,a novel SoH estimation approach using support vector regression with a Gaussian kernel optimized using the Bayesian optimization technique(BO-SVR with a Gaussian kernel)was proposed.Unlike,traditional approaches that use the internal resistance,and battery capacity as input parameters,this study utilized the equivalent discharging voltage difference interval and equivalent charging voltage difference interval,as they capture the dynamic voltage characteristics associated with the battery degradation.The model was simulated using MATLAB 2023a.The mean absolute error,R2,root mean squared error,and mean squared error were considered as performance indicators.The simulation results indicated that the proposed BO-SVR with a Gaussian kernel model had superior performance to other kernel SVR and Gaussian Process Regression models,with a reduced RMSE of 0.0082,thus demonstrating its potential to predict the SoH more accurately.展开更多
In this paper, we propose a large-update primal-dual interior point algorithm for P_*(κ)-linear complementarity problem. The method is based on a new class of kernel functions which is neither classical logarithmi...In this paper, we propose a large-update primal-dual interior point algorithm for P_*(κ)-linear complementarity problem. The method is based on a new class of kernel functions which is neither classical logarithmic function nor self-regular functions. It is determines both search directions and the proximity measure between the iterate and the center path. We show that if a strictly feasible starting point is available, then the new algorithm has O(1 + 2κ)p√n(1/plog n + 1)^2 lognε iteration complexity which becomes O((1 + 2κ)√nlog n logn/ε)with special choice of the parameter p. It is matches the currently best known iteration bound for P*(κ)-linear complementarity problem. Some computational results have been provided.展开更多
The numerical simulation of the fluid flow and the flexible rod(s)interaction is more complicated and has lower efficiency due to the high computational cost.In this paper,a semi-resolved model coupling the computatio...The numerical simulation of the fluid flow and the flexible rod(s)interaction is more complicated and has lower efficiency due to the high computational cost.In this paper,a semi-resolved model coupling the computational fluid dynamics and the flexible rod dynamics is proposed using a two-way domain expansion method.The gov-erning equations of the flexible rod dynamics are discretized and solved by the finite element method,and the fluid flow is simulated by the finite volume method.The interaction between fluids and solid rods is modeled by introducing body force terms into the momentum equations.Referred to the traditional semi-resolved numerical model,an anisotropic Gaussian kernel function method is proposed to specify the interactive forces between flu-ids and solid bodies for non-circle rod cross-sections.A benchmark of the flow passing around a single flexible plate with a rectangular cross-section is used to validate the algorithm.Focused on the engineering applications,a test case of a finite patch of cylinders is implemented to validate the accuracy and efficiency of the coupled model.展开更多
A support vector machine (SVM) with quadratic polynomial kernel function based nonlinear model one-step-ahead predictive controller is presented. The SVM based predictive model is established with black-box identifica...A support vector machine (SVM) with quadratic polynomial kernel function based nonlinear model one-step-ahead predictive controller is presented. The SVM based predictive model is established with black-box identification method. By solving a cubic equation in the feature space, an explicit predictive control law is obtained through the predictive control mechanism. The effect of controller is demonstrated on a recognized benchmark problem and on the control of continuous-stirred tank reactor (CSTR). Simulation results show that SVM with quadratic polynomial kernel function based predictive controller can be well applied to nonlinear systems, with good performance in following reference trajectory as well as in disturbance-rejection.展开更多
Multi-kernel-based support vector machine (SVM) model structure of nonlinear systems and its specific identification method is proposed, which is composed of a SVM with linear kernel function followed in series by a...Multi-kernel-based support vector machine (SVM) model structure of nonlinear systems and its specific identification method is proposed, which is composed of a SVM with linear kernel function followed in series by a SVM with spline kernel function. With the help of this model, nonlinear model predictive control can be transformed to linear model predictive control, and consequently a unified analytical solution of optimal input of multi-step-ahead predictive control is possible to derive. This algorithm does not require online iterative optimization in order to be suitable for real-time control with less calculation. The simulation results of pH neutralization process and CSTR reactor show the effectiveness and advantages of the presented algorithm.展开更多
The accurate estimation of road traffic states can provide decision making for travelers and traffic managers.In this work,an algorithm based on kernel-k nearest neighbor(KNN)matching of road traffic spatial character...The accurate estimation of road traffic states can provide decision making for travelers and traffic managers.In this work,an algorithm based on kernel-k nearest neighbor(KNN)matching of road traffic spatial characteristics is presented to estimate road traffic states.Firstly,the representative road traffic state data were extracted to establish the reference sequences of road traffic running characteristics(RSRTRC).Secondly,the spatial road traffic state data sequence was selected and the kernel function was constructed,with which the spatial road traffic data sequence could be mapped into a high dimensional feature space.Thirdly,the referenced and current spatial road traffic data sequences were extracted and the Euclidean distances in the feature space between them were obtained.Finally,the road traffic states were estimated from weighted averages of the selected k road traffic states,which corresponded to the nearest Euclidean distances.Several typical links in Beijing were adopted for case studies.The final results of the experiments show that the accuracy of this algorithm for estimating speed and volume is 95.27%and 91.32%respectively,which prove that this road traffic states estimation approach based on kernel-KNN matching of road traffic spatial characteristics is feasible and can achieve a high accuracy.展开更多
Landslide probability prediction plays an important role in understanding landslide information in advance and taking preventive measures.Many factors can influence the occurrence of landslides,which is easy to have a...Landslide probability prediction plays an important role in understanding landslide information in advance and taking preventive measures.Many factors can influence the occurrence of landslides,which is easy to have a curse of dimensionality and thus lead to reduce prediction accuracy.Then the generalization ability of the model will also decline sharply when there are only small samples.To reduce the dimension of calculation and balance the model’s generalization and learning ability,this study proposed a landslide prediction method based on improved principal component analysis(PCA)and mixed kernel function least squares support vector regression(LSSVR)model.First,the traditional PCA was introduced with the idea of linear discrimination,and the dimensions of initial influencing factors were reduced from 8 to 3.The improved PCA can not only weight variables but also extract the original feature.Furthermore,combined with global and local kernel function,the mixed kernel function LSSVR model was framed to improve the generalization ability.Whale optimization algorithm(WOA)was used to optimize the parameters.Moreover,Root Mean Square Error(RMSE),the sum of squared errors(SSE),Mean Absolute Error(MAE),Mean Absolute Precentage Error(MAPE),and reliability were employed to verify the performance of the model.Compared with radial basis function(RBF)LSSVR model,Elman neural network model,and fuzzy decision model,the proposed method has a smaller deviation.Finally,the landslide warning level obtained from the landslide probability can also provide references for relevant decision-making departments in emergency response.展开更多
A fast algorithm based on the grayscale distribution of infrared target and the weighted kernel function was proposed for the moving target detection(MTD) in dynamic scene of image series. This algorithm is used to de...A fast algorithm based on the grayscale distribution of infrared target and the weighted kernel function was proposed for the moving target detection(MTD) in dynamic scene of image series. This algorithm is used to deal with issues like the large computational complexity, the fluctuation of grayscale, and the noise in infrared images. Four characteristic points were selected by analyzing the grayscale distribution in infrared image, of which the series was quickly matched with an affine transformation model. The image was then divided into 32×32 squares and the gray-weighted kernel(GWK) for each square was calculated. At last, the MTD was carried out according to the variation of the four GWKs. The results indicate that the MTD can be achieved in real time using the algorithm with the fluctuations of grayscale and noise can be effectively suppressed. The detection probability is greater than 90% with the false alarm rate lower than 5% when the calculation time is less than 40 ms.展开更多
In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear ...In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear growth term to derive the search direction,and by introducing new technical results and selecting suitable parameters,we prove that the iteration bound of the algorithm is as good as best-known polynomial complexity of interior-point methods.Furthermore,numerical results illustrate the efficiency of the proposed method.展开更多
In this paper,we propose and analyze a full-Newton step feasible interior-point algorithm for semidefinite optimization based on a kernel function with linear growth term.The kernel function is used both for determini...In this paper,we propose and analyze a full-Newton step feasible interior-point algorithm for semidefinite optimization based on a kernel function with linear growth term.The kernel function is used both for determining the search directions and for measuring the distance between the given iterate and theμ-center for the algorithm.By developing a new norm-based proximity measure and some technical results,we derive the iteration bound that coincides with the currently best known iteration bound for the algorithm with small-update method.In our knowledge,this result is the first instance of full-Newton step feasible interior-point method for SDO which involving the kernel function.展开更多
To improve performance of a support vector regression, a new method for a modified kernel function is proposed. In this method, information of all samples is included in the kernel function with conformal mapping. Thu...To improve performance of a support vector regression, a new method for a modified kernel function is proposed. In this method, information of all samples is included in the kernel function with conformal mapping. Thus the kernel function is data-dependent. With a random initial parameter, the kernel function is modified repeatedly until a satisfactory result is achieved. Compared with the conventional model, the improved approach does not need to select parameters of the kernel function. Sim- ulation is carried out for the one-dimension continuous function and a case of strong earthquakes. The results show that the improved approach has better learning ability and forecasting precision than the traditional model. With the increase of the iteration number, the figure of merit decreases and converges. The speed of convergence depends on the parameters used in the algorithm.展开更多
A SVMs (Support Vector Machines) based method to identify Chinese place names is presented. In our approach, place name candidate is located according to a rational forming assumption, then SVMs based identification s...A SVMs (Support Vector Machines) based method to identify Chinese place names is presented. In our approach, place name candidate is located according to a rational forming assumption, then SVMs based identification strategy is used to distinguish whether one candidate is true place name or not. Referring to linguistic knowledge, basic semanteme of a contextual word and frequency information of words inside place name candidate are selected as features in our methodology. So dimension in the feature space is reduced dramatically and processing procedure is performed more efficiently. Result of open testing on unregistered place names achieves F-measure 83.25 in 8.17 million words news based on this project.展开更多
A high-precision regional gravity field model is significant in various geodesy applications.In the field of modelling regional gravity fields,the spherical radial basis functions(SRBFs)approach has recently gained wi...A high-precision regional gravity field model is significant in various geodesy applications.In the field of modelling regional gravity fields,the spherical radial basis functions(SRBFs)approach has recently gained widespread attention,while the modelling precision is primarily influenced by the base function network.In this study,we propose a method for constructing a data-adaptive network of SRBFs using a modified Hierarchical Density-Based Spatial Clustering of Applications with Noise(HDBSCAN)algorithm,and the performance of the algorithm is verified by the observed gravity data in the Auvergne area.Furthermore,the turning point method is used to optimize the bandwidth of the basis function spectrum,which satisfies the demand for both high-precision gravity field and quasi-geoid modelling simultaneously.Numerical experimental results indicate that our algorithm has an accuracy of about 1.58 mGal in constructing the gravity field model and about 0.03 m in the regional quasi-geoid model.Compared to the existing methods,the number of SRBFs used for modelling has been reduced by 15.8%,and the time cost to determine the centre positions of SRBFs has been saved by 12.5%.Hence,the modified HDBSCAN algorithm presented here is a suitable design method for constructing the SRBF data adaptive network.展开更多
A polynomial interior-point algorithm is presented for monotone linear complementarity problem (MLCP) based on a class of kernel functions with the general barrier term, which are called general kernel functions. Un...A polynomial interior-point algorithm is presented for monotone linear complementarity problem (MLCP) based on a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.展开更多
Let {Xn, n≥1} be a strictly stationary sequence of random variables, which are either associated or negatively associated, f(.) be their common density. In this paper, the author shows a central limit theorem for a k...Let {Xn, n≥1} be a strictly stationary sequence of random variables, which are either associated or negatively associated, f(.) be their common density. In this paper, the author shows a central limit theorem for a kernel estimate of f(.) under certain regular conditions.展开更多
In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barr...In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O(nlog(n/c)) and O(√nlog(n/ε)). This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions.展开更多
This paper presents a nonlinear multidimensional scaling model, called kernelized fourth quantifica- tion theory, which is an integration of kernel techniques and the fourth quantification theory. The model can deal w...This paper presents a nonlinear multidimensional scaling model, called kernelized fourth quantifica- tion theory, which is an integration of kernel techniques and the fourth quantification theory. The model can deal with the problem of mineral prediction without defining a training area. In mineral target prediction, the pre-defined statistical cells, such as grid cells, can be implicitly transformed using kernel techniques from input space to a high-dimensional feature space, where the nonlinearly separable clusters in the input space are ex- pected to be linearly separable. Then, the transformed cells in the feature space are mapped by the fourth quan- tifieation theory onto a low-dimensional scaling space, where the sealed cells can be visually clustered according to their spatial locations. At the same time, those cells, which are far away from the cluster center of the majority of the sealed cells, are recognized as anomaly cells. Finally, whether the anomaly cells can serve as mineral potential target cells can be tested by spatially superimposing the known mineral occurrences onto the anomaly ceils. A case study shows that nearly all the known mineral occurrences spatially coincide with the anomaly cells with nearly the smallest scaled coordinates in one-dimensional sealing space. In the case study, the mineral target cells delineated by the new model are similar to those predicted by the well-known WofE model.展开更多
Logistic regression is often used to solve linear binary classification problems such as machine vision,speech recognition,and handwriting recognition.However,it usually fails to solve certain nonlinear multi-classifi...Logistic regression is often used to solve linear binary classification problems such as machine vision,speech recognition,and handwriting recognition.However,it usually fails to solve certain nonlinear multi-classification problem,such as problem with non-equilibrium samples.Many scholars have proposed some methods,such as neural network,least square support vector machine,AdaBoost meta-algorithm,etc.These methods essentially belong to machine learning categories.In this work,based on the probability theory and statistical principle,we propose an improved logistic regression algorithm based on kernel density estimation for solving nonlinear multi-classification.We have compared our approach with other methods using non-equilibrium samples,the results show that our approach guarantees sample integrity and achieves superior classification.展开更多
In polyester fiber industrial processes,the prediction of key performance indicators is vital for product quality.The esterification process is an indispensable step in the polyester polymerization process.It has the ...In polyester fiber industrial processes,the prediction of key performance indicators is vital for product quality.The esterification process is an indispensable step in the polyester polymerization process.It has the characteristics of strong coupling,nonlinearity and complex mechanism.To solve these problems,we put forward a multi-output Gaussian process regression(MGPR)model based on the combined kernel function for the polyester esterification process.Since the seasonal and trend decomposition using loess(STL)can extract the periodic and trend characteristics of time series,a combined kernel function based on the STL and the kernel function analysis is constructed for the MGPR.The effectiveness of the proposed model is verified by the actual polyester esterification process data collected from fiber production.展开更多
基金supported by the China Agriculture Research System of MOF and MARAthe National Natural Science Foundation of China (31872337 and 31501919)the Agricultural Science and Technology Innovation Project,China (ASTIP-IAS02)。
摘要The advantages of genome selection(GS) in animal and plant breeding are self-evident.Traditional parametric models have disadvantage in better fit the increasingly large sequencing data and capture complex effects accurately.Machine learning models have demonstrated remarkable potential in addressing these challenges.In this study,we introduced the concept of mixed kernel functions to explore the performance of support vector machine regression(SVR) in GS.Six single kernel functions(SVR_L,SVR_C,SVR_G,SVR_P,SVR_S,SVR_L) and four mixed kernel functions(SVR_GS,SVR_GP,SVR_LS,SVR_LP) were used to predict genome breeding values.The prediction accuracy,mean squared error(MSE) and mean absolute error(MAE) were used as evaluation indicators to compare with two traditional parametric models(GBLUP,BayesB) and two popular machine learning models(RF,KcRR).The results indicate that in most cases,the performance of the mixed kernel function model significantly outperforms that of GBLUP,BayesB and single kernel function.For instance,for T1 in the pig dataset,the predictive accuracy of SVR_GS is improved by 10% compared to GBLUP,and by approximately 4.4 and 18.6% compared to SVR_G and SVR_S respectively.For E1 in the wheat dataset,SVR_GS achieves 13.3% higher prediction accuracy than GBLUP.Among single kernel functions,the Laplacian and Gaussian kernel functions yield similar results,with the Gaussian kernel function performing better.The mixed kernel function notably reduces the MSE and MAE when compared to all single kernel functions.Furthermore,regarding runtime,SVR_GS and SVR_GP mixed kernel functions run approximately three times faster than GBLUP in the pig dataset,with only a slight increase in runtime compared to the single kernel function model.In summary,the mixed kernel function model of SVR demonstrates speed and accuracy competitiveness,and the model such as SVR_GS has important application potential for GS.
基金supported by the Royal Academy of Engineering,UK,under the scheme of Distinguished International Associates(DIA-2424-5-134).
摘要The state of health SoH of lithium ion batteries plays a predominant role in ensuring the safe and reliable operation of electric vehicles.In this,a novel SoH estimation approach using support vector regression with a Gaussian kernel optimized using the Bayesian optimization technique(BO-SVR with a Gaussian kernel)was proposed.Unlike,traditional approaches that use the internal resistance,and battery capacity as input parameters,this study utilized the equivalent discharging voltage difference interval and equivalent charging voltage difference interval,as they capture the dynamic voltage characteristics associated with the battery degradation.The model was simulated using MATLAB 2023a.The mean absolute error,R2,root mean squared error,and mean squared error were considered as performance indicators.The simulation results indicated that the proposed BO-SVR with a Gaussian kernel model had superior performance to other kernel SVR and Gaussian Process Regression models,with a reduced RMSE of 0.0082,thus demonstrating its potential to predict the SoH more accurately.
基金Supported by Natural Science Foundation of China(Grant No.71471102)
摘要In this paper, we propose a large-update primal-dual interior point algorithm for P_*(κ)-linear complementarity problem. The method is based on a new class of kernel functions which is neither classical logarithmic function nor self-regular functions. It is determines both search directions and the proximity measure between the iterate and the center path. We show that if a strictly feasible starting point is available, then the new algorithm has O(1 + 2κ)p√n(1/plog n + 1)^2 lognε iteration complexity which becomes O((1 + 2κ)√nlog n logn/ε)with special choice of the parameter p. It is matches the currently best known iteration bound for P*(κ)-linear complementarity problem. Some computational results have been provided.
基金supported by Shanghai 2021“Science and Technology Innovation Action Plan”:Social Development Science and Technology Research Project(Grant No.21DZ1202703).
摘要The numerical simulation of the fluid flow and the flexible rod(s)interaction is more complicated and has lower efficiency due to the high computational cost.In this paper,a semi-resolved model coupling the computational fluid dynamics and the flexible rod dynamics is proposed using a two-way domain expansion method.The gov-erning equations of the flexible rod dynamics are discretized and solved by the finite element method,and the fluid flow is simulated by the finite volume method.The interaction between fluids and solid rods is modeled by introducing body force terms into the momentum equations.Referred to the traditional semi-resolved numerical model,an anisotropic Gaussian kernel function method is proposed to specify the interactive forces between flu-ids and solid bodies for non-circle rod cross-sections.A benchmark of the flow passing around a single flexible plate with a rectangular cross-section is used to validate the algorithm.Focused on the engineering applications,a test case of a finite patch of cylinders is implemented to validate the accuracy and efficiency of the coupled model.
基金Support by China 973 Project (No. 2002CB312200).
摘要A support vector machine (SVM) with quadratic polynomial kernel function based nonlinear model one-step-ahead predictive controller is presented. The SVM based predictive model is established with black-box identification method. By solving a cubic equation in the feature space, an explicit predictive control law is obtained through the predictive control mechanism. The effect of controller is demonstrated on a recognized benchmark problem and on the control of continuous-stirred tank reactor (CSTR). Simulation results show that SVM with quadratic polynomial kernel function based predictive controller can be well applied to nonlinear systems, with good performance in following reference trajectory as well as in disturbance-rejection.
基金Supported by the State Key Development Program for Basic Research of China (No.2002CB312200) and the National Natural Science Foundation of China (No.60574019).
摘要Multi-kernel-based support vector machine (SVM) model structure of nonlinear systems and its specific identification method is proposed, which is composed of a SVM with linear kernel function followed in series by a SVM with spline kernel function. With the help of this model, nonlinear model predictive control can be transformed to linear model predictive control, and consequently a unified analytical solution of optimal input of multi-step-ahead predictive control is possible to derive. This algorithm does not require online iterative optimization in order to be suitable for real-time control with less calculation. The simulation results of pH neutralization process and CSTR reactor show the effectiveness and advantages of the presented algorithm.
基金Projects(LQ16E080012,LY14F030012)supported by the Zhejiang Provincial Natural Science Foundation,ChinaProject(61573317)supported by the National Natural Science Foundation of ChinaProject(2015001)supported by the Open Fund for a Key-Key Discipline of Zhejiang University of Technology,China
摘要The accurate estimation of road traffic states can provide decision making for travelers and traffic managers.In this work,an algorithm based on kernel-k nearest neighbor(KNN)matching of road traffic spatial characteristics is presented to estimate road traffic states.Firstly,the representative road traffic state data were extracted to establish the reference sequences of road traffic running characteristics(RSRTRC).Secondly,the spatial road traffic state data sequence was selected and the kernel function was constructed,with which the spatial road traffic data sequence could be mapped into a high dimensional feature space.Thirdly,the referenced and current spatial road traffic data sequences were extracted and the Euclidean distances in the feature space between them were obtained.Finally,the road traffic states were estimated from weighted averages of the selected k road traffic states,which corresponded to the nearest Euclidean distances.Several typical links in Beijing were adopted for case studies.The final results of the experiments show that the accuracy of this algorithm for estimating speed and volume is 95.27%and 91.32%respectively,which prove that this road traffic states estimation approach based on kernel-KNN matching of road traffic spatial characteristics is feasible and can achieve a high accuracy.
基金supported by the Natural Science Foundation of Shaanxi Province(Grant No.2019JQ206)in part by the Science and Technology Department of Shaanxi Province(Grant No.2020CGXNG-009)in part by the Education Department of Shaanxi Province under Grant 17JK0346.
摘要Landslide probability prediction plays an important role in understanding landslide information in advance and taking preventive measures.Many factors can influence the occurrence of landslides,which is easy to have a curse of dimensionality and thus lead to reduce prediction accuracy.Then the generalization ability of the model will also decline sharply when there are only small samples.To reduce the dimension of calculation and balance the model’s generalization and learning ability,this study proposed a landslide prediction method based on improved principal component analysis(PCA)and mixed kernel function least squares support vector regression(LSSVR)model.First,the traditional PCA was introduced with the idea of linear discrimination,and the dimensions of initial influencing factors were reduced from 8 to 3.The improved PCA can not only weight variables but also extract the original feature.Furthermore,combined with global and local kernel function,the mixed kernel function LSSVR model was framed to improve the generalization ability.Whale optimization algorithm(WOA)was used to optimize the parameters.Moreover,Root Mean Square Error(RMSE),the sum of squared errors(SSE),Mean Absolute Error(MAE),Mean Absolute Precentage Error(MAPE),and reliability were employed to verify the performance of the model.Compared with radial basis function(RBF)LSSVR model,Elman neural network model,and fuzzy decision model,the proposed method has a smaller deviation.Finally,the landslide warning level obtained from the landslide probability can also provide references for relevant decision-making departments in emergency response.
基金Project(61101185)supported by the National Natural Science Foundation of China
摘要A fast algorithm based on the grayscale distribution of infrared target and the weighted kernel function was proposed for the moving target detection(MTD) in dynamic scene of image series. This algorithm is used to deal with issues like the large computational complexity, the fluctuation of grayscale, and the noise in infrared images. Four characteristic points were selected by analyzing the grayscale distribution in infrared image, of which the series was quickly matched with an affine transformation model. The image was then divided into 32×32 squares and the gray-weighted kernel(GWK) for each square was calculated. At last, the MTD was carried out according to the variation of the four GWKs. The results indicate that the MTD can be achieved in real time using the algorithm with the fluctuations of grayscale and noise can be effectively suppressed. The detection probability is greater than 90% with the false alarm rate lower than 5% when the calculation time is less than 40 ms.
基金Supported by University Science Research Project of Anhui Province(2023AH052921)Outstanding Youth Talent Project of Anhui Province(gxyq2021254)。
摘要In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear growth term to derive the search direction,and by introducing new technical results and selecting suitable parameters,we prove that the iteration bound of the algorithm is as good as best-known polynomial complexity of interior-point methods.Furthermore,numerical results illustrate the efficiency of the proposed method.
基金Supported by University Science Research Project of Anhui Province(KJ2019A1297)University Teaching Research Project of Anhui Province(2019jxtd144)。
摘要In this paper,we propose and analyze a full-Newton step feasible interior-point algorithm for semidefinite optimization based on a kernel function with linear growth term.The kernel function is used both for determining the search directions and for measuring the distance between the given iterate and theμ-center for the algorithm.By developing a new norm-based proximity measure and some technical results,we derive the iteration bound that coincides with the currently best known iteration bound for the algorithm with small-update method.In our knowledge,this result is the first instance of full-Newton step feasible interior-point method for SDO which involving the kernel function.
基金Project supported by the National Natural Science Foundation of China (No. 50578168)the Natural Science Foundation of CQ CSTC (No. 2007BB2396)
摘要To improve performance of a support vector regression, a new method for a modified kernel function is proposed. In this method, information of all samples is included in the kernel function with conformal mapping. Thus the kernel function is data-dependent. With a random initial parameter, the kernel function is modified repeatedly until a satisfactory result is achieved. Compared with the conventional model, the improved approach does not need to select parameters of the kernel function. Sim- ulation is carried out for the one-dimension continuous function and a case of strong earthquakes. The results show that the improved approach has better learning ability and forecasting precision than the traditional model. With the increase of the iteration number, the figure of merit decreases and converges. The speed of convergence depends on the parameters used in the algorithm.
基金Foundation of China(Grant No.60175020and60673037) and the National High Technology Research and Development Program of China (Grant No.2002AA117010-09).
摘要A SVMs (Support Vector Machines) based method to identify Chinese place names is presented. In our approach, place name candidate is located according to a rational forming assumption, then SVMs based identification strategy is used to distinguish whether one candidate is true place name or not. Referring to linguistic knowledge, basic semanteme of a contextual word and frequency information of words inside place name candidate are selected as features in our methodology. So dimension in the feature space is reduced dramatically and processing procedure is performed more efficiently. Result of open testing on unregistered place names achieves F-measure 83.25 in 8.17 million words news based on this project.
基金funded by The Fundamental Research Funds for Chinese Academy of surveying and mapping(AR2402)Open Fund of Wuhan,Gravitation and Solid Earth Tides,National Observation and Research Station(No.WHYWZ202213)。
摘要A high-precision regional gravity field model is significant in various geodesy applications.In the field of modelling regional gravity fields,the spherical radial basis functions(SRBFs)approach has recently gained widespread attention,while the modelling precision is primarily influenced by the base function network.In this study,we propose a method for constructing a data-adaptive network of SRBFs using a modified Hierarchical Density-Based Spatial Clustering of Applications with Noise(HDBSCAN)algorithm,and the performance of the algorithm is verified by the observed gravity data in the Auvergne area.Furthermore,the turning point method is used to optimize the bandwidth of the basis function spectrum,which satisfies the demand for both high-precision gravity field and quasi-geoid modelling simultaneously.Numerical experimental results indicate that our algorithm has an accuracy of about 1.58 mGal in constructing the gravity field model and about 0.03 m in the regional quasi-geoid model.Compared to the existing methods,the number of SRBFs used for modelling has been reduced by 15.8%,and the time cost to determine the centre positions of SRBFs has been saved by 12.5%.Hence,the modified HDBSCAN algorithm presented here is a suitable design method for constructing the SRBF data adaptive network.
基金supported by the National Natural Science Foundation of China (Grant No.10771133)the Shanghai Pujiang Program (Grant No.06PJ14039)
摘要A polynomial interior-point algorithm is presented for monotone linear complementarity problem (MLCP) based on a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.
摘要Let {Xn, n≥1} be a strictly stationary sequence of random variables, which are either associated or negatively associated, f(.) be their common density. In this paper, the author shows a central limit theorem for a kernel estimate of f(.) under certain regular conditions.
基金Supported by the Natural Science Foundation of Hubei Province (2008CDZD47)
摘要In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O(nlog(n/c)) and O(√nlog(n/ε)). This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions.
基金supported by National Natural Science Foundation of China (No.40872193)
摘要This paper presents a nonlinear multidimensional scaling model, called kernelized fourth quantifica- tion theory, which is an integration of kernel techniques and the fourth quantification theory. The model can deal with the problem of mineral prediction without defining a training area. In mineral target prediction, the pre-defined statistical cells, such as grid cells, can be implicitly transformed using kernel techniques from input space to a high-dimensional feature space, where the nonlinearly separable clusters in the input space are ex- pected to be linearly separable. Then, the transformed cells in the feature space are mapped by the fourth quan- tifieation theory onto a low-dimensional scaling space, where the sealed cells can be visually clustered according to their spatial locations. At the same time, those cells, which are far away from the cluster center of the majority of the sealed cells, are recognized as anomaly cells. Finally, whether the anomaly cells can serve as mineral potential target cells can be tested by spatially superimposing the known mineral occurrences onto the anomaly ceils. A case study shows that nearly all the known mineral occurrences spatially coincide with the anomaly cells with nearly the smallest scaled coordinates in one-dimensional sealing space. In the case study, the mineral target cells delineated by the new model are similar to those predicted by the well-known WofE model.
基金The authors would like to thank all anonymous reviewers for their suggestions and feedback.This work was supported by National Natural Science Foundation of China(Grant No.61379103).
摘要Logistic regression is often used to solve linear binary classification problems such as machine vision,speech recognition,and handwriting recognition.However,it usually fails to solve certain nonlinear multi-classification problem,such as problem with non-equilibrium samples.Many scholars have proposed some methods,such as neural network,least square support vector machine,AdaBoost meta-algorithm,etc.These methods essentially belong to machine learning categories.In this work,based on the probability theory and statistical principle,we propose an improved logistic regression algorithm based on kernel density estimation for solving nonlinear multi-classification.We have compared our approach with other methods using non-equilibrium samples,the results show that our approach guarantees sample integrity and achieves superior classification.
基金Natural Science Foundation of Shanghai,China(No.19ZR1402300)。
摘要In polyester fiber industrial processes,the prediction of key performance indicators is vital for product quality.The esterification process is an indispensable step in the polyester polymerization process.It has the characteristics of strong coupling,nonlinearity and complex mechanism.To solve these problems,we put forward a multi-output Gaussian process regression(MGPR)model based on the combined kernel function for the polyester esterification process.Since the seasonal and trend decomposition using loess(STL)can extract the periodic and trend characteristics of time series,a combined kernel function based on the STL and the kernel function analysis is constructed for the MGPR.The effectiveness of the proposed model is verified by the actual polyester esterification process data collected from fiber production.