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.展开更多
Fuzzy c-means(FCM) clustering algorithm is sensitive to noise points and outlier data, and the possibilistic fuzzy c-means(PFCM) clustering algorithm overcomes the problem well, but PFCM clustering algorithm has some ...Fuzzy c-means(FCM) clustering algorithm is sensitive to noise points and outlier data, and the possibilistic fuzzy c-means(PFCM) clustering algorithm overcomes the problem well, but PFCM clustering algorithm has some problems: it is still sensitive to initial clustering centers and the clustering results are not good when the tested datasets with noise are very unequal. An improved kernel possibilistic fuzzy c-means algorithm based on invasive weed optimization(IWO-KPFCM) is proposed in this paper. This algorithm first uses invasive weed optimization(IWO) algorithm to seek the optimal solution as the initial clustering centers, and introduces kernel method to make the input data from the sample space map into the high-dimensional feature space. Then, the sample variance is introduced in the objection function to measure the compact degree of data. Finally, the improved algorithm is used to cluster data. The simulation results of the University of California-Irvine(UCI) data sets and artificial data sets show that the proposed algorithm has stronger ability to resist noise, higher cluster accuracy and faster convergence speed than the PFCM algorithm.展开更多
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.展开更多
Recognition of substrates in cobalt crust mining areas can improve mining efficiency.Aiming at the problem of unsatisfactory performance of using single feature to recognize the seabed material of the cobalt crust min...Recognition of substrates in cobalt crust mining areas can improve mining efficiency.Aiming at the problem of unsatisfactory performance of using single feature to recognize the seabed material of the cobalt crust mining area,a method based on multiple-feature sets is proposed.Features of the target echoes are extracted by linear prediction method and wavelet analysis methods,and the linear prediction coefficient and linear prediction cepstrum coefficient are also extracted.Meanwhile,the characteristic matrices of modulus maxima,sub-band energy and multi-resolution singular spectrum entropy are obtained,respectively.The resulting features are subsequently compressed by kernel Fisher discriminant analysis(KFDA),the output features are selected using genetic algorithm(GA)to obtain optimal feature subsets,and recognition results of classifier are chosen as genetic fitness function.The advantages of this method are that it can describe the signal features more comprehensively and select the favorable features and remove the redundant features to the greatest extent.The experimental results show the better performance of the proposed method in comparison with only using KFDA or GA.展开更多
Kernal factor analysis （KFA） with vafimax was proposed by using Mercer kernel function which can map the data in the original space to a high-dimensional feature space, and was compared with the kernel principle com...Kernal factor analysis （KFA） with vafimax was proposed by using Mercer kernel function which can map the data in the original space to a high-dimensional feature space, and was compared with the kernel principle component analysis （KPCA）. The results show that the best error rate in handwritten digit recognition by kernel factor analysis with vadmax （4.2%） was superior to KPCA （4.4%）. The KFA with varimax could more accurately image handwritten digit recognition.展开更多
These problems of nonlinearity, fuzziness and few labeled data were rarely considered in traditional remote sensing image classification. A semi-supervised kernel fuzzy C-means （SSKFCM） algorithm is proposed to over...These problems of nonlinearity, fuzziness and few labeled data were rarely considered in traditional remote sensing image classification. A semi-supervised kernel fuzzy C-means （SSKFCM） algorithm is proposed to overcome these disadvantages of remote sensing image classification in this paper. The SSKFCM algorithm is achieved by introducing a kernel method and semi-supervised learning technique into the standard fuzzy C-means （FCM） algorithm. A set of Beijing-1 micro-satellite＇s multispectral images are adopted to be classified by several algorithms, such as FCM, kernel FCM （KFCM）, semi-supervised FCM （SSFCM） and SSKFCM. The classification results are estimated by corresponding indexes. The results indicate that the SSKFCM algorithm significantly improves the classification accuracy of remote sensing images compared with the others.展开更多
CC’s(Cloud Computing)networks are distributed and dynamic as signals appear/disappear or lose significance.MLTs(Machine learning Techniques)train datasets which sometime are inadequate in terms of sample for inferrin...CC’s(Cloud Computing)networks are distributed and dynamic as signals appear/disappear or lose significance.MLTs(Machine learning Techniques)train datasets which sometime are inadequate in terms of sample for inferring information.A dynamic strategy,DevMLOps(Development Machine Learning Operations)used in automatic selections and tunings of MLTs result in significant performance differences.But,the scheme has many disadvantages including continuity in training,more samples and training time in feature selections and increased classification execution times.RFEs(Recursive Feature Eliminations)are computationally very expensive in its operations as it traverses through each feature without considering correlations between them.This problem can be overcome by the use of Wrappers as they select better features by accounting for test and train datasets.The aim of this paper is to use DevQLMLOps for automated tuning and selections based on orchestrations and messaging between containers.The proposed AKFA(Adaptive Kernel Firefly Algorithm)is for selecting features for CNM(Cloud Network Monitoring)operations.AKFA methodology is demonstrated using CNSD(Cloud Network Security Dataset)with satisfactory results in the performance metrics like precision,recall,F-measure and accuracy used.展开更多
This paper presents a new kernel-based algorithm for video object tracking called rebound of region of interest (RROI). The novel algorithm uses a rectangle-shaped section as region of interest (ROI) to represent and ...This paper presents a new kernel-based algorithm for video object tracking called rebound of region of interest (RROI). The novel algorithm uses a rectangle-shaped section as region of interest (ROI) to represent and track specific objects in videos. The proposed algorithm is constituted by two stages. The first stage seeks to determine the direction of the object’s motion by analyzing the changing regions around the object being tracked between two consecutive frames. Once the direction of the object’s motion has been predicted, it is initialized an iterative process that seeks to minimize a function of dissimilarity in order to find the location of the object being tracked in the next frame. The main advantage of the proposed algorithm is that, unlike existing kernel-based methods, it is immune to highly cluttered conditions. The results obtained by the proposed algorithm show that the tracking process was successfully carried out for a set of color videos with different challenging conditions such as occlusion, illumination changes, cluttered conditions, and object scale changes.展开更多
As one of the most serious geological disasters in deep underground engineering,rockburst has caused a large number of casualties.However,because of the complex relationship between the inducing factors and rockburst ...As one of the most serious geological disasters in deep underground engineering,rockburst has caused a large number of casualties.However,because of the complex relationship between the inducing factors and rockburst intensity,the problem of rockburst intensity prediction has not been well solved until now.In this study,we collect 292 sets of rockburst data including eight parameters,such as the maximum tangential stress of the surrounding rock σ_(θ),the uniaxial compressive strength of the rockσc,the uniaxial tensile strength of the rock σ_(t),and the strain energy storage index W_(et),etc.from more than 20 underground projects as training sets and establish two new rockburst prediction models based on the kernel extreme learning machine(KELM)combined with the genetic algorithm(KELM-GA)and cross-entropy method(KELM-CEM).To further verify the effect of the two models,ten sets of rockburst data from Shuangjiangkou Hydropower Station are selected for analysis and the results show that new models are more accurate compared with five traditional empirical criteria,especially the model based on KELM-CEM which has the accuracy rate of 90%.Meanwhile,the results of 10 consecutive runs of the model based on KELM-CEM are almost the same,meaning that the model has good stability and reliability for engineering applications.展开更多
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,R^(2),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 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.
文摘Fuzzy c-means(FCM) clustering algorithm is sensitive to noise points and outlier data, and the possibilistic fuzzy c-means(PFCM) clustering algorithm overcomes the problem well, but PFCM clustering algorithm has some problems: it is still sensitive to initial clustering centers and the clustering results are not good when the tested datasets with noise are very unequal. An improved kernel possibilistic fuzzy c-means algorithm based on invasive weed optimization(IWO-KPFCM) is proposed in this paper. This algorithm first uses invasive weed optimization(IWO) algorithm to seek the optimal solution as the initial clustering centers, and introduces kernel method to make the input data from the sample space map into the high-dimensional feature space. Then, the sample variance is introduced in the objection function to measure the compact degree of data. Finally, the improved algorithm is used to cluster data. The simulation results of the University of California-Irvine(UCI) data sets and artificial data sets show that the proposed algorithm has stronger ability to resist noise, higher cluster accuracy and faster convergence speed than the PFCM algorithm.
基金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.
基金Project(51874353)supported by the National Natural Science Foundation of ChinaProject(GCX20190898Y)supported by Mittal Student Innovation Project,China。
文摘Recognition of substrates in cobalt crust mining areas can improve mining efficiency.Aiming at the problem of unsatisfactory performance of using single feature to recognize the seabed material of the cobalt crust mining area,a method based on multiple-feature sets is proposed.Features of the target echoes are extracted by linear prediction method and wavelet analysis methods,and the linear prediction coefficient and linear prediction cepstrum coefficient are also extracted.Meanwhile,the characteristic matrices of modulus maxima,sub-band energy and multi-resolution singular spectrum entropy are obtained,respectively.The resulting features are subsequently compressed by kernel Fisher discriminant analysis(KFDA),the output features are selected using genetic algorithm(GA)to obtain optimal feature subsets,and recognition results of classifier are chosen as genetic fitness function.The advantages of this method are that it can describe the signal features more comprehensively and select the favorable features and remove the redundant features to the greatest extent.The experimental results show the better performance of the proposed method in comparison with only using KFDA or GA.
基金The National Defence Foundation of China (No.NEWL51435Qt220401)
文摘Kernal factor analysis （KFA） with vafimax was proposed by using Mercer kernel function which can map the data in the original space to a high-dimensional feature space, and was compared with the kernel principle component analysis （KPCA）. The results show that the best error rate in handwritten digit recognition by kernel factor analysis with vadmax （4.2%） was superior to KPCA （4.4%）. The KFA with varimax could more accurately image handwritten digit recognition.
基金Supported by the National High Technology Research and Development Programme （No.2007AA12Z227） and the National Natural Science Foundation of China （No.40701146）.
文摘These problems of nonlinearity, fuzziness and few labeled data were rarely considered in traditional remote sensing image classification. A semi-supervised kernel fuzzy C-means （SSKFCM） algorithm is proposed to overcome these disadvantages of remote sensing image classification in this paper. The SSKFCM algorithm is achieved by introducing a kernel method and semi-supervised learning technique into the standard fuzzy C-means （FCM） algorithm. A set of Beijing-1 micro-satellite＇s multispectral images are adopted to be classified by several algorithms, such as FCM, kernel FCM （KFCM）, semi-supervised FCM （SSFCM） and SSKFCM. The classification results are estimated by corresponding indexes. The results indicate that the SSKFCM algorithm significantly improves the classification accuracy of remote sensing images compared with the others.
文摘CC’s(Cloud Computing)networks are distributed and dynamic as signals appear/disappear or lose significance.MLTs(Machine learning Techniques)train datasets which sometime are inadequate in terms of sample for inferring information.A dynamic strategy,DevMLOps(Development Machine Learning Operations)used in automatic selections and tunings of MLTs result in significant performance differences.But,the scheme has many disadvantages including continuity in training,more samples and training time in feature selections and increased classification execution times.RFEs(Recursive Feature Eliminations)are computationally very expensive in its operations as it traverses through each feature without considering correlations between them.This problem can be overcome by the use of Wrappers as they select better features by accounting for test and train datasets.The aim of this paper is to use DevQLMLOps for automated tuning and selections based on orchestrations and messaging between containers.The proposed AKFA(Adaptive Kernel Firefly Algorithm)is for selecting features for CNM(Cloud Network Monitoring)operations.AKFA methodology is demonstrated using CNSD(Cloud Network Security Dataset)with satisfactory results in the performance metrics like precision,recall,F-measure and accuracy used.
文摘This paper presents a new kernel-based algorithm for video object tracking called rebound of region of interest (RROI). The novel algorithm uses a rectangle-shaped section as region of interest (ROI) to represent and track specific objects in videos. The proposed algorithm is constituted by two stages. The first stage seeks to determine the direction of the object’s motion by analyzing the changing regions around the object being tracked between two consecutive frames. Once the direction of the object’s motion has been predicted, it is initialized an iterative process that seeks to minimize a function of dissimilarity in order to find the location of the object being tracked in the next frame. The main advantage of the proposed algorithm is that, unlike existing kernel-based methods, it is immune to highly cluttered conditions. The results obtained by the proposed algorithm show that the tracking process was successfully carried out for a set of color videos with different challenging conditions such as occlusion, illumination changes, cluttered conditions, and object scale changes.
基金funded by National Natural Science Foundation of China(Grants Nos.41825018 and 42141009)the Second Tibetan Plateau Scientific Expedition and Research Program(Grants No.2019QZKK0904)。
文摘As one of the most serious geological disasters in deep underground engineering,rockburst has caused a large number of casualties.However,because of the complex relationship between the inducing factors and rockburst intensity,the problem of rockburst intensity prediction has not been well solved until now.In this study,we collect 292 sets of rockburst data including eight parameters,such as the maximum tangential stress of the surrounding rock σ_(θ),the uniaxial compressive strength of the rockσc,the uniaxial tensile strength of the rock σ_(t),and the strain energy storage index W_(et),etc.from more than 20 underground projects as training sets and establish two new rockburst prediction models based on the kernel extreme learning machine(KELM)combined with the genetic algorithm(KELM-GA)and cross-entropy method(KELM-CEM).To further verify the effect of the two models,ten sets of rockburst data from Shuangjiangkou Hydropower Station are selected for analysis and the results show that new models are more accurate compared with five traditional empirical criteria,especially the model based on KELM-CEM which has the accuracy rate of 90%.Meanwhile,the results of 10 consecutive runs of the model based on KELM-CEM are almost the same,meaning that the model has good stability and reliability for engineering applications.
基金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,R^(2),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.
