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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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 charact...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.展开更多
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 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.展开更多
Wavelet, a powerful tool for signal processing, can be used to approximate the target func-tion. For enhancing the sparse property of wavelet approximation, a new algorithm was proposed by using wavelet kernel Support...Wavelet, a powerful tool for signal processing, can be used to approximate the target func-tion. For enhancing the sparse property of wavelet approximation, a new algorithm was proposed by using wavelet kernel Support Vector Machines (SVM), which can converge to minimum error with bet-ter sparsity. Here, wavelet functions would be firstly used to construct the admitted kernel for SVM according to Mercy theory; then new SVM with this kernel can be used to approximate the target fun-citon with better sparsity than wavelet approxiamtion itself. The results obtained by our simulation ex-periment show the feasibility and validity of wavelet kernel support vector machines.展开更多
The main objective of this work is to decompose orthogonally the reproducing kernels Hilbert space using any conditionally positive definite kernels into smaller ones by introducing the theory of power kernels, and to...The main objective of this work is to decompose orthogonally the reproducing kernels Hilbert space using any conditionally positive definite kernels into smaller ones by introducing the theory of power kernels, and to show how to do this decomposition recur- sively. It may be used to split large interpolation problems into smaller ones with different kernels which are related to the original kernels. To reach this objective, we will reconstruct the reproducing kernels Hilbert space for the normalized and the extended kernels and give the recursive algorithm of this decomposition.展开更多
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.展开更多
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.展开更多
We use holomorphic invariants to calculate the Bergman kernel for generalized quasi-homogeneous Reinhardt-Hartogs domains. In addition, we present a complete orthonormal basis for the Bergman space on bounded Reinhard...We use holomorphic invariants to calculate the Bergman kernel for generalized quasi-homogeneous Reinhardt-Hartogs domains. In addition, we present a complete orthonormal basis for the Bergman space on bounded Reinhardt-Hartogs domains.展开更多
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.展开更多
Panicle swarm optimization （PSO） is an optimization algorithm based on the swarm intelligent principle. In this paper the modified PSO is applied to a kernel principal component analysis （ KPCA ） for an optimal ke...Panicle swarm optimization （PSO） is an optimization algorithm based on the swarm intelligent principle. In this paper the modified PSO is applied to a kernel principal component analysis （ KPCA ） for an optimal kernel function parameter. We first comprehensively considered within-class scatter and between-class scatter of the sample features. Then, the fitness function of an optimized kernel function parameter is constructed, and the particle swarm optimization algorithm with adaptive acceleration （CPSO） is applied to optimizing it. It is used for gearbox condi- tion recognition, and the result is compared with the recognized results based on principal component analysis （PCA）. The results show that KPCA optimized by CPSO can effectively recognize fault conditions of the gearbox by reducing bind set-up of the kernel function parameter, and its results of fault recognition outperform those of PCA. We draw the conclusion that KPCA based on CPSO has an advantage in nonlinear feature extraction of mechanical failure, and is helpful for fault condition recognition of complicated machines.展开更多
In this paper, we compute the Bergman kernel function on WIII.and RIII(q) denote the Cartan domain of the third class. Because domain WIII is neither homogeneous domain nor Reinhardt domain, we will use a new way to s...In this paper, we compute the Bergman kernel function on WIII.and RIII(q) denote the Cartan domain of the third class. Because domain WIII is neither homogeneous domain nor Reinhardt domain, we will use a new way to solve this problem. First, we give a holomorphic automorphism group, such that for any Zo, there exists an element of this group, which maps (W, Zo) into (W,O). Second, introduce the concept of semi-Reinhardt and discuss the complete orthonormal system of this domain.展开更多
A support vector machine （SVM） based multiuser detection （MUD） scheme in code-division multi- ple-access （CDMA） system is proposed. In this scheme, the equivalent support vector （SV） is obtained through a kern...A support vector machine （SVM） based multiuser detection （MUD） scheme in code-division multi- ple-access （CDMA） system is proposed. In this scheme, the equivalent support vector （SV） is obtained through a kernel sparsity approximation algorithm, which avoids the conventional costly quadratic pro-gramming （QP） procedure in SVM. Besides, the coefficient of the SV is attained through the solution to a generalized eigenproblem. Simulation results show that the proposed scheme has almost the same bit er-ror rate （BER） as the standard SVM and is better than minimum mean square error （MMSE） scheme. Meanwhile, it has a low comoutation complexity.展开更多
Based on continuum power regression(CPR) method, a novel derivation of kernel partial least squares(named CPR-KPLS) regression is proposed for approximating arbitrary nonlinear functions.Kernel function is used to map...Based on continuum power regression(CPR) method, a novel derivation of kernel partial least squares(named CPR-KPLS) regression is proposed for approximating arbitrary nonlinear functions.Kernel function is used to map the input variables(input space) into a Reproducing Kernel Hilbert Space(so called feature space),where a linear CPR-PLS is constructed based on the projection of explanatory variables to latent variables(components). The linear CPR-PLS in the high-dimensional feature space corresponds to a nonlinear CPR-KPLS in the original input space. This method offers a novel extension for kernel partial least squares regression(KPLS),and some numerical simulation results are presented to illustrate the feasibility of the proposed method.展开更多
Is this paper we shall give cm asymptotic expansion formula of the kernel functim for the Quasi Faurier-Legendre series on an ellipse, whose error is 0(1/n2) and then applying it we shall sham an analogue of an exact ...Is this paper we shall give cm asymptotic expansion formula of the kernel functim for the Quasi Faurier-Legendre series on an ellipse, whose error is 0(1/n2) and then applying it we shall sham an analogue of an exact result in trigonometric series.展开更多
基金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.
基金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 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.
基金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 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.
基金Supported by the NSFC（10771144 11071171） Supported by the Beijing Natural Science Foundation（1082005） Supported by the Excellent Doctoral Thesis Prize of Beijing（2008）
文摘We obtain the Bergman kernel for a new type of Hartogs domain.The corresponding LU Qi-Keng's problem is considered.
基金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.
基金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.
基金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.
文摘Wavelet, a powerful tool for signal processing, can be used to approximate the target func-tion. For enhancing the sparse property of wavelet approximation, a new algorithm was proposed by using wavelet kernel Support Vector Machines (SVM), which can converge to minimum error with bet-ter sparsity. Here, wavelet functions would be firstly used to construct the admitted kernel for SVM according to Mercy theory; then new SVM with this kernel can be used to approximate the target fun-citon with better sparsity than wavelet approxiamtion itself. The results obtained by our simulation ex-periment show the feasibility and validity of wavelet kernel support vector machines.
文摘The main objective of this work is to decompose orthogonally the reproducing kernels Hilbert space using any conditionally positive definite kernels into smaller ones by introducing the theory of power kernels, and to show how to do this decomposition recur- sively. It may be used to split large interpolation problems into smaller ones with different kernels which are related to the original kernels. To reach this objective, we will reconstruct the reproducing kernels Hilbert space for the normalized and the extended kernels and give the recursive algorithm of this decomposition.
基金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.
基金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.
基金supported by the National Natural Science Foundation of China(11371257)Colleges and Universities Science and Technology Research Foundation of Hebei Province(QN2016304)
文摘We use holomorphic invariants to calculate the Bergman kernel for generalized quasi-homogeneous Reinhardt-Hartogs domains. In addition, we present a complete orthonormal basis for the Bergman space on bounded Reinhardt-Hartogs domains.
基金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.
基金supported by National Natural Science Foundation under Grant No.50875247Shanxi Province Natural Science Foundation under Grant No.2009011026-1
文摘Panicle swarm optimization （PSO） is an optimization algorithm based on the swarm intelligent principle. In this paper the modified PSO is applied to a kernel principal component analysis （ KPCA ） for an optimal kernel function parameter. We first comprehensively considered within-class scatter and between-class scatter of the sample features. Then, the fitness function of an optimized kernel function parameter is constructed, and the particle swarm optimization algorithm with adaptive acceleration （CPSO） is applied to optimizing it. It is used for gearbox condi- tion recognition, and the result is compared with the recognized results based on principal component analysis （PCA）. The results show that KPCA optimized by CPSO can effectively recognize fault conditions of the gearbox by reducing bind set-up of the kernel function parameter, and its results of fault recognition outperform those of PCA. We draw the conclusion that KPCA based on CPSO has an advantage in nonlinear feature extraction of mechanical failure, and is helpful for fault condition recognition of complicated machines.
文摘In this paper, we compute the Bergman kernel function on WIII.and RIII(q) denote the Cartan domain of the third class. Because domain WIII is neither homogeneous domain nor Reinhardt domain, we will use a new way to solve this problem. First, we give a holomorphic automorphism group, such that for any Zo, there exists an element of this group, which maps (W, Zo) into (W,O). Second, introduce the concept of semi-Reinhardt and discuss the complete orthonormal system of this domain.
文摘A support vector machine （SVM） based multiuser detection （MUD） scheme in code-division multi- ple-access （CDMA） system is proposed. In this scheme, the equivalent support vector （SV） is obtained through a kernel sparsity approximation algorithm, which avoids the conventional costly quadratic pro-gramming （QP） procedure in SVM. Besides, the coefficient of the SV is attained through the solution to a generalized eigenproblem. Simulation results show that the proposed scheme has almost the same bit er-ror rate （BER） as the standard SVM and is better than minimum mean square error （MMSE） scheme. Meanwhile, it has a low comoutation complexity.
文摘Based on continuum power regression(CPR) method, a novel derivation of kernel partial least squares(named CPR-KPLS) regression is proposed for approximating arbitrary nonlinear functions.Kernel function is used to map the input variables(input space) into a Reproducing Kernel Hilbert Space(so called feature space),where a linear CPR-PLS is constructed based on the projection of explanatory variables to latent variables(components). The linear CPR-PLS in the high-dimensional feature space corresponds to a nonlinear CPR-KPLS in the original input space. This method offers a novel extension for kernel partial least squares regression(KPLS),and some numerical simulation results are presented to illustrate the feasibility of the proposed method.
文摘Is this paper we shall give cm asymptotic expansion formula of the kernel functim for the Quasi Faurier-Legendre series on an ellipse, whose error is 0(1/n2) and then applying it we shall sham an analogue of an exact result in trigonometric series.
