The paper deals with the state estimation of the widely used scaled unscented Kalman filter（UKF）. In particular, the stress is laid on the scaling parameters selection principle for the scaled UKF. Several problems ...The paper deals with the state estimation of the widely used scaled unscented Kalman filter（UKF）. In particular, the stress is laid on the scaling parameters selection principle for the scaled UKF. Several problems caused by recommended constant scaling parameters are highlighted. On the basis of the analyses, an effective scaled UKF is proposed with self-adaptive scaling parameters,which is easy to understand and implement in engineering. Two typical strong nonlinear examples are given and their simulation results show the effectiveness of the proposed principle and algorithm.展开更多
The support vector machine （SVM） is a novel machine learning method, which has the ability to approximate nonlinear functions with arbitrary accuracy. Setting parameters well is very crucial for SVM learning results...The support vector machine （SVM） is a novel machine learning method, which has the ability to approximate nonlinear functions with arbitrary accuracy. Setting parameters well is very crucial for SVM learning results and generalization ability, and now there is no systematic, general method for parameter selection. In this article, the SVM parameter selection for function approximation is regarded as a compound optimization problem and a mutative scale chaos optimization algorithm is employed to search for optimal paraxneter values. The chaos optimization algorithm is an effective way for global optimal and the mutative scale chaos algorithm could improve the search efficiency and accuracy. Several simulation examples show the sensitivity of the SVM parameters and demonstrate the superiority of this proposed method for nonlinear function approximation.展开更多
Aimed at the problem that the traditional suppressed fuzzy C-means clustering algorithms ignore the real needs of different objects, applying the same suppressed parameter for modifying membership degrees of all the o...Aimed at the problem that the traditional suppressed fuzzy C-means clustering algorithms ignore the real needs of different objects, applying the same suppressed parameter for modifying membership degrees of all the objects, a novel partition region-based suppressed fuzzy C-means clustering algorithm with better capacity of adaptability and robustness is proposed in this paper. The model based on the real needs of different objects is built, making it clear to decide whether to proceed with further determination; in addition, the external user-defined suppressed parameter is automatically selected according to the intrinsic structural characteristic of each dataset, making the proposed method become robust to the fluctuations in the incoming dataset and initial conditions. Experimental results show that the proposed method is more robust than its counterparts and overcomes the weakness of the original suppressed clustering algorithm in most cases.展开更多
基金supported by the National Natural Science Foundation of China(61703228)
文摘The paper deals with the state estimation of the widely used scaled unscented Kalman filter（UKF）. In particular, the stress is laid on the scaling parameters selection principle for the scaled UKF. Several problems caused by recommended constant scaling parameters are highlighted. On the basis of the analyses, an effective scaled UKF is proposed with self-adaptive scaling parameters,which is easy to understand and implement in engineering. Two typical strong nonlinear examples are given and their simulation results show the effectiveness of the proposed principle and algorithm.
基金the National Nature Science Foundation of China (60775047, 60402024)
文摘The support vector machine （SVM） is a novel machine learning method, which has the ability to approximate nonlinear functions with arbitrary accuracy. Setting parameters well is very crucial for SVM learning results and generalization ability, and now there is no systematic, general method for parameter selection. In this article, the SVM parameter selection for function approximation is regarded as a compound optimization problem and a mutative scale chaos optimization algorithm is employed to search for optimal paraxneter values. The chaos optimization algorithm is an effective way for global optimal and the mutative scale chaos algorithm could improve the search efficiency and accuracy. Several simulation examples show the sensitivity of the SVM parameters and demonstrate the superiority of this proposed method for nonlinear function approximation.
基金supported by the National Natural Science Foundation of China(61401363)the Science and Technology on Avionics Integration Laboratory and Aeronautical Science Foundation(20155153034)+1 种基金the Fundamental Research Funds for the Central Universities(3102016AXXX0053102015BJJGZ009)
文摘Aimed at the problem that the traditional suppressed fuzzy C-means clustering algorithms ignore the real needs of different objects, applying the same suppressed parameter for modifying membership degrees of all the objects, a novel partition region-based suppressed fuzzy C-means clustering algorithm with better capacity of adaptability and robustness is proposed in this paper. The model based on the real needs of different objects is built, making it clear to decide whether to proceed with further determination; in addition, the external user-defined suppressed parameter is automatically selected according to the intrinsic structural characteristic of each dataset, making the proposed method become robust to the fluctuations in the incoming dataset and initial conditions. Experimental results show that the proposed method is more robust than its counterparts and overcomes the weakness of the original suppressed clustering algorithm in most cases.
