传统的误差配准算法假设系统偏差恒定或缓慢变化,当系统误差发生突变或快速变化时,这一假设不再成立。针对这一问题,研究了时变条件下的误差配准算法,引入渐消因子,对常规的基于地心地固坐标系的广义最小二乘算法(generalized least squ...传统的误差配准算法假设系统偏差恒定或缓慢变化,当系统误差发生突变或快速变化时,这一假设不再成立。针对这一问题,研究了时变条件下的误差配准算法,引入渐消因子,对常规的基于地心地固坐标系的广义最小二乘算法(generalized least squares algorithm based on the earth-centered earth-fixed coordinate system,ECEF-GLS)进行了修正,弱化历史量测对配准的影响,并对渐消因子的选取问题进行了研究,给出了合理的设计方法。算法验证表明,基于渐消因子的ECEF-GLS估计算法能够对时变的系统偏差进行有效估计,精度满足配准要求。展开更多
提出了一种基于最小二乘支持向量机的织物剪切性能预测模型,并且采用遗传算法进行最小二乘支持向量机的参数优化,将获得的样本进行归一化处理后,将其输入预测模型以得到预测结果.仿真结果表明,基于最小二乘支持向量机的预测模型比BP神...提出了一种基于最小二乘支持向量机的织物剪切性能预测模型,并且采用遗传算法进行最小二乘支持向量机的参数优化,将获得的样本进行归一化处理后,将其输入预测模型以得到预测结果.仿真结果表明,基于最小二乘支持向量机的预测模型比BP神经网络和线性回归方法具有更高的精度和范化能力.
Abstract：
A new method is proposed to predict the fabric shearing property with least square support vector machines ( LS-SVM ). The genetic algorithm is investigated to select the parameters of LS-SVM models as a means of improving the LS- SVM prediction. After normalizing the sampling data, the sampling data are inputted into the model to gain the prediction result. The simulation results show the prediction model gives better forecasting accuracy and generalization ability than BP neural network and linear regression method.展开更多
In this paper, we propose a simple learning algorithm for non\|linear function approximation and system modeling using minimal radial basis function neural network with high generalization performance. A hybrid algori...In this paper, we propose a simple learning algorithm for non\|linear function approximation and system modeling using minimal radial basis function neural network with high generalization performance. A hybrid algorithm is constructed, which combines recursive n \|means clustering algorithm with a simple recursive regularized least squares algorithm (SRRLS). The n \|means clustering algorithm adjusts the centers of the network, while the SRRLS constructs a parsimonious network which makes the generalization performance of the network well. The SRRLS algorithm needs no matrix computing, so it has a lower computational cost and no ill\|conditional problem. Because of the recursive manner, this algorithm is suitable for on\|line applications. The effectiveness of this algorithm is demonstrated by two benchmark examples.展开更多
文摘传统的误差配准算法假设系统偏差恒定或缓慢变化,当系统误差发生突变或快速变化时,这一假设不再成立。针对这一问题,研究了时变条件下的误差配准算法,引入渐消因子,对常规的基于地心地固坐标系的广义最小二乘算法(generalized least squares algorithm based on the earth-centered earth-fixed coordinate system,ECEF-GLS)进行了修正,弱化历史量测对配准的影响,并对渐消因子的选取问题进行了研究,给出了合理的设计方法。算法验证表明,基于渐消因子的ECEF-GLS估计算法能够对时变的系统偏差进行有效估计,精度满足配准要求。
文摘提出了一种基于最小二乘支持向量机的织物剪切性能预测模型,并且采用遗传算法进行最小二乘支持向量机的参数优化,将获得的样本进行归一化处理后,将其输入预测模型以得到预测结果.仿真结果表明,基于最小二乘支持向量机的预测模型比BP神经网络和线性回归方法具有更高的精度和范化能力.
Abstract：
A new method is proposed to predict the fabric shearing property with least square support vector machines ( LS-SVM ). The genetic algorithm is investigated to select the parameters of LS-SVM models as a means of improving the LS- SVM prediction. After normalizing the sampling data, the sampling data are inputted into the model to gain the prediction result. The simulation results show the prediction model gives better forecasting accuracy and generalization ability than BP neural network and linear regression method.
基金This work is supported by the International Pioneering Center of TEDATianjinP.R China
文摘In this paper, we propose a simple learning algorithm for non\|linear function approximation and system modeling using minimal radial basis function neural network with high generalization performance. A hybrid algorithm is constructed, which combines recursive n \|means clustering algorithm with a simple recursive regularized least squares algorithm (SRRLS). The n \|means clustering algorithm adjusts the centers of the network, while the SRRLS constructs a parsimonious network which makes the generalization performance of the network well. The SRRLS algorithm needs no matrix computing, so it has a lower computational cost and no ill\|conditional problem. Because of the recursive manner, this algorithm is suitable for on\|line applications. The effectiveness of this algorithm is demonstrated by two benchmark examples.
