The high-speed development of space defense technology demands a high state estimation capacity for spacecraft tracking methods.However,reentry flight is accompanied by complex flight environments,which brings to the ...The high-speed development of space defense technology demands a high state estimation capacity for spacecraft tracking methods.However,reentry flight is accompanied by complex flight environments,which brings to the uncertain,complex,and strongly coupled non-Gaussian detection noise.As a result,there are several intractable considerations on the problem of state estimation tasks corrupted by complex non-Gaussian outliers for non-linear dynamics systems in practical application.To address these issues,a new iterated rational quadratic(RQ)kernel high-order unscented Kalman filtering(IRQHUKF)algorithm via capturing the statistics to break through the limitations of the Gaussian assumption is proposed.Firstly,the characteristic analysis of the RQ kernel is investigated in detail,which is the first attempt to carry out an exploration of the heavy-tailed characteristic and the ability on capturing highorder moments of the RQ kernel.Subsequently,the RQ kernel method is first introduced into the UKF algorithm as an error optimization criterion,termed the iterated RQ kernel-UKF(RQ-UKF)algorithm by derived analytically,which not only retains the high-order moments propagation process but also enhances the approximation capacity in the non-Gaussian noise problem for its ability in capturing highorder moments and heavy-tailed characteristics.Meanwhile,to tackle the limitations of the Gaussian distribution assumption in the linearization process of the non-linear systems,the high-order Sigma Points(SP)as a subsidiary role in propagating the state high-order statistics is devised by the moments matching method to improve the RQ-UKF.Finally,to further improve the flexibility of the IRQ-HUKF algorithm in practical application,an adaptive kernel parameter is derived analytically grounded in the Kullback-Leibler divergence(KLD)method and parametric sensitivity analysis of the RQ kernel.The simulation results demonstrate that the novel IRQ-HUKF algorithm is more robust and outperforms the existing advanced UKF with respect to the kernel method in reentry vehicle tracking scenarios under various noise environments.展开更多
Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is...Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is to learn the kernel from the data automatically. A general regularized risk functional （RRF） criterion for kernel matrix learning is proposed. Compared with the RRF criterion, general RRF criterion takes into account the geometric distributions of the embedding data points. It is proven that the distance between different geometric distdbutions can be estimated by their centroid distance in the reproducing kernel Hilbert space. Using this criterion for kernel matrix learning leads to a convex quadratically constrained quadratic programming （QCQP） problem. For several commonly used loss functions, their mathematical formulations are given. Experiment results on a collection of benchmark data sets demonstrate the effectiveness of the proposed method.展开更多
The fuzzy C-means clustering algorithm(FCM) to the fuzzy kernel C-means clustering algorithm(FKCM) to effectively perform cluster analysis on the diversiform structures are extended, such as non-hyperspherical data, d...The fuzzy C-means clustering algorithm(FCM) to the fuzzy kernel C-means clustering algorithm(FKCM) to effectively perform cluster analysis on the diversiform structures are extended, such as non-hyperspherical data, data with noise, data with mixture of heterogeneous cluster prototypes, asymmetric data, etc. Based on the Mercer kernel, FKCM clustering algorithm is derived from FCM algorithm united with kernel method. The results of experiments with the synthetic and real data show that the FKCM clustering algorithm is universality and can effectively unsupervised analyze datasets with variform structures in contrast to FCM algorithm. It is can be imagined that kernel-based clustering algorithm is one of important research direction of fuzzy clustering analysis.展开更多
In order to meet the demand of online optimal running, a novel soft sensor modeling approach based on Gaussian processes was proposed. The approach is moderately simple to implement and use without loss of performance...In order to meet the demand of online optimal running, a novel soft sensor modeling approach based on Gaussian processes was proposed. The approach is moderately simple to implement and use without loss of performance. It is trained by optimizing the hyperparameters using the scaled conjugate gradient algorithm with the squared exponential covariance function employed. Experimental simulations show that the soft sensor modeling approach has the advantage via a real-world example in a refinery. Meanwhile, the method opens new possibilities for application of kernel methods to potential fields.展开更多
Driven by the challenge of integrating large amount of experimental data, classification technique emerges as one of the major and popular tools in computational biology and bioinformatics research. Machine learning m...Driven by the challenge of integrating large amount of experimental data, classification technique emerges as one of the major and popular tools in computational biology and bioinformatics research. Machine learning methods, especially kernel methods with Support Vector Machines （SVMs） are very popular and effective tools. In the perspective of kernel matrix, a technique namely Eigen- matrix translation has been introduced for protein data classification. The Eigen-matrix translation strategy has a lot of nice properties which deserve more exploration. This paper investigates the major role of Eigen-matrix translation in classification. The authors propose that its importance lies in the dimension reduction of predictor attributes within the data set. This is very important when the dimension of features is huge. The authors show by numerical experiments on real biological data sets that the proposed framework is crucial and effective in improving classification accuracy. This can therefore serve as a novel perspective for future research in dimension reduction problems.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.12072090.
文摘The high-speed development of space defense technology demands a high state estimation capacity for spacecraft tracking methods.However,reentry flight is accompanied by complex flight environments,which brings to the uncertain,complex,and strongly coupled non-Gaussian detection noise.As a result,there are several intractable considerations on the problem of state estimation tasks corrupted by complex non-Gaussian outliers for non-linear dynamics systems in practical application.To address these issues,a new iterated rational quadratic(RQ)kernel high-order unscented Kalman filtering(IRQHUKF)algorithm via capturing the statistics to break through the limitations of the Gaussian assumption is proposed.Firstly,the characteristic analysis of the RQ kernel is investigated in detail,which is the first attempt to carry out an exploration of the heavy-tailed characteristic and the ability on capturing highorder moments of the RQ kernel.Subsequently,the RQ kernel method is first introduced into the UKF algorithm as an error optimization criterion,termed the iterated RQ kernel-UKF(RQ-UKF)algorithm by derived analytically,which not only retains the high-order moments propagation process but also enhances the approximation capacity in the non-Gaussian noise problem for its ability in capturing highorder moments and heavy-tailed characteristics.Meanwhile,to tackle the limitations of the Gaussian distribution assumption in the linearization process of the non-linear systems,the high-order Sigma Points(SP)as a subsidiary role in propagating the state high-order statistics is devised by the moments matching method to improve the RQ-UKF.Finally,to further improve the flexibility of the IRQ-HUKF algorithm in practical application,an adaptive kernel parameter is derived analytically grounded in the Kullback-Leibler divergence(KLD)method and parametric sensitivity analysis of the RQ kernel.The simulation results demonstrate that the novel IRQ-HUKF algorithm is more robust and outperforms the existing advanced UKF with respect to the kernel method in reentry vehicle tracking scenarios under various noise environments.
基金supported by the National Natural Science Fundation of China (60736021)the Joint Funds of NSFC-Guangdong Province(U0735003)
文摘Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is to learn the kernel from the data automatically. A general regularized risk functional （RRF） criterion for kernel matrix learning is proposed. Compared with the RRF criterion, general RRF criterion takes into account the geometric distributions of the embedding data points. It is proven that the distance between different geometric distdbutions can be estimated by their centroid distance in the reproducing kernel Hilbert space. Using this criterion for kernel matrix learning leads to a convex quadratically constrained quadratic programming （QCQP） problem. For several commonly used loss functions, their mathematical formulations are given. Experiment results on a collection of benchmark data sets demonstrate the effectiveness of the proposed method.
文摘The fuzzy C-means clustering algorithm(FCM) to the fuzzy kernel C-means clustering algorithm(FKCM) to effectively perform cluster analysis on the diversiform structures are extended, such as non-hyperspherical data, data with noise, data with mixture of heterogeneous cluster prototypes, asymmetric data, etc. Based on the Mercer kernel, FKCM clustering algorithm is derived from FCM algorithm united with kernel method. The results of experiments with the synthetic and real data show that the FKCM clustering algorithm is universality and can effectively unsupervised analyze datasets with variform structures in contrast to FCM algorithm. It is can be imagined that kernel-based clustering algorithm is one of important research direction of fuzzy clustering analysis.
文摘In order to meet the demand of online optimal running, a novel soft sensor modeling approach based on Gaussian processes was proposed. The approach is moderately simple to implement and use without loss of performance. It is trained by optimizing the hyperparameters using the scaled conjugate gradient algorithm with the squared exponential covariance function employed. Experimental simulations show that the soft sensor modeling approach has the advantage via a real-world example in a refinery. Meanwhile, the method opens new possibilities for application of kernel methods to potential fields.
基金supported by Research Grants Council of Hong Kong under Grant No.17301214HKU CERG Grants,Fundamental Research Funds for the Central Universities+2 种基金the Research Funds of Renmin University of ChinaHung Hing Ying Physical Research Grantthe Natural Science Foundation of China under Grant No.11271144
文摘Driven by the challenge of integrating large amount of experimental data, classification technique emerges as one of the major and popular tools in computational biology and bioinformatics research. Machine learning methods, especially kernel methods with Support Vector Machines （SVMs） are very popular and effective tools. In the perspective of kernel matrix, a technique namely Eigen- matrix translation has been introduced for protein data classification. The Eigen-matrix translation strategy has a lot of nice properties which deserve more exploration. This paper investigates the major role of Eigen-matrix translation in classification. The authors propose that its importance lies in the dimension reduction of predictor attributes within the data set. This is very important when the dimension of features is huge. The authors show by numerical experiments on real biological data sets that the proposed framework is crucial and effective in improving classification accuracy. This can therefore serve as a novel perspective for future research in dimension reduction problems.
