一种基于高斯核的RBF神经网络学习算法

RBF神经网络中心等参数确定得是否合理将直接影响到RBF神经网络的学习性能。通过有监督学习的方法来确定RBF神经网络的中心等参数是最一般化的方法。在这种方法中,参数的初始化问题是关键问题。文章在分析RBF神经网络映射性能的基础上,提出了中心等参数初始化的一种方法,并借助于梯度下降法给出了RBF神经网络的学习算法。多种实例表明,所给出的学习算法是有效的。该研究为RBF神经网络的广泛应用提供了一定的技术保障。     

Reformulated radial basis neural networks trained by gradientdescent

This paper presents an axiomatic approach for constructing radial basis function (RBF) neural networks. This approach results in a broad variety of admissible RBF models, including those employing Gaussian RBFs. The form of the RBFs is determined by a generator function. New RBF models can be developed according to the proposed approach by selecting generator functions other than exponential ones, which lead to Gaussian RBFs. This paper also proposes a supervised learning algorithm based on gradient descent for training reformulated RBF neural networks constructed using the proposed approach. A sensitivity analysis of the proposed algorithm relates the properties of RBFs with the convergence of gradient descent learning. Experiments involving a variety of reformulated RBF networks generated by linear and exponential generator functions indicate that gradient descent learning is simple, easily implementable, and produces RBF networks that perform considerably better than conventional RBF models trained by existing algorithms     

径向基函数神经网络的一种两级学习方法

建立RBF(radial basis function)神经网络模型关键在于确定网络隐中心向量、基宽度参数和隐节点数.为设计结构简单,且具有良好泛化性能径向基网络结构,本文提出了一种RBF网络的两级学习新设计方法.该方法在下级由正则化正交最小二乘法与D-最优试验设计结合算法自动构建结构节俭的RBF网络模型;在上级通过粒子群优化算法优选结合算法中影响网络泛化性能的3个学习参数,即基宽度参数、正则化系数和D-最优代价系数的最佳参数组合.仿真实例表明了该方法的有效性.     

一种新的RBF网络两级学习设计方法

为了简化径向基网络结构,构造出良好泛化性能力的网络,提出了一种径向基(RBF)网络的两级学习新设计方法.在下级将正交最小二乘法(OLS)与A-最优设计方法(A-opt)相结合(OLS+A-opt),引入一种基于A-最优设计准则的混合代价函数,同时优化网络模型的逼近性能及模型的充分性,自动构建结构节俭的RBF网络模型;而方法中的关键学习参数A-最优代价系数通过上级粒子群优化方法(PSO)优化获取最佳值.仿真结果表明该方法所设计的RBF网络不仅具有较好的泛化性能,而且也具有良好的模型鲁棒性及充分性,是一种有效的RBF网络设计方法.     

径向基函数（RBF）神经网络的一种极大熵学习算法

RBF神经网络中心向量的确定是整个网络学习的关键,该文基于信息论中的极大熵原理构造了训练中心向量的极大熵聚类算法,由此给出了网络的极大熵学习算法。文中最后分别用一个时间序列预测和系统辨识问题验证了该学习算法的有效性,同RBF网络和多层感知机的误差回传算法相比,该算法不仅在学习精度和泛化推广能力上有一定程度的提高,而且学习时间有显著的降低。     

一种基于改进k-means的RBF神经网络学习方法

针对传统RBF神经网络学习算法构造的网络分类精度不高,传统的k-means算法对初始聚类中心的敏感,聚类结果随不同的初始输入而波动。为了解决以上问题,提出一种基于改进k-means的RBF神经网络学习算法。先用减聚类算法优化k-means算法,消除聚类的敏感性,再用优化后的k-means算法构造RBF神经网络。仿真结果表明了该学习算法的实用性和有效性。     

基于径向基函数神经网络的混沌背景谐波提取

为提高强混沌背景下谐波信号的提取能力,给出混沌系统的单步预测模型,提出了一种新的径向基函数神经网络模型.由混沌吸引子的维数来确定网络的输入,并给出了基于卡尔曼滤波器的动态学习算法,利用学习算法可以在网络训练时同时确定径向基神经网络隐层中心和输出层权值,提高了网络的收敛速度和预测性能.通过对Bossler混沌背景下低信噪比谐波信号的提取进行计算机认真实验,并且实验表明信噪比最低达一27dB时,仍能有效提取出谐波信号,验证了算法的有效性和可行性.     

一种基于群体智能的人工神经网络学习算法

将群体智能优化理论引入一种前馈式人工神经网络——径向基函数（RBF）神经网络的学习训练过程,提出了基于智能微粒群算法的RBF神经网络学习算法,并与传统RBF神经网络学习算法进行了比较,实验结果证明了该方法的有效性。     

一种基于卡尔曼滤波和模糊控制的RBF神经网络新型学习算法

提出了基于Kalman滤波最优估计和模糊控制的径向基函数（Radical Basis Function, RBF）神经网络学习算法,用实例进行了仿真实验。结果表明,与传统的RBF网络学习算法比较,该算法具有明显快速的学习效率和较高的识别精度.     

Application of temporal difference learning rules in short‐term traffic flow prediction

Studying dynamic behaviours of a transportation system requires the use of the system mathematical models as well as prediction of traffic flow in the system. Therefore, traffic flow prediction plays an important role in today's intelligent transportation systems. This article introduces a new approach to short‐term daily traffic flow prediction based on artificial neural networks. Among the family of neural networks, multi‐layer perceptron (MLP), radial basis function (RBF) neural network and wavenets have been selected as the three best candidates for performing traffic flow prediction. Moreover, back‐propagation (BP) has been adapted as the most efficient learning scheme in all the cases. It is shown that the coefficients produced by temporal signals improve the performance of the BP learning (BPL) algorithm. Temporal signals provide researchers with a new model of temporal difference BP learning algorithm (TDBPL). The capability and performance of TDBPL algorithm are examined by means of simulation in order to prove that the wavelet theory, with its multi‐resolution ability in comparison to RBF neural networks, is a suitable algorithm in traffic flow forecasting. It is also concluded that despite MLP applications, RBF neural networks do not provide negative forecasts. In addition, the local minimum problems are inevitable in MLP algorithms, while RBF neural networks and wavenet networks do not encounter them.     

A generalized growing and pruning RBF (GGAP-RBF) neural network for function approximation

This work presents a new sequential learning algorithm for radial basis function (RBF) networks referred to as generalized growing and pruning algorithm for RBF (GGAP-RBF). The paper first introduces the concept of significance for the hidden neurons and then uses it in the learning algorithm to realize parsimonious networks. The growing and pruning strategy of GGAP-RBF is based on linking the required learning accuracy with the significance of the nearest or intentionally added new neuron. Significance of a neuron is a measure of the average information content of that neuron. The GGAP-RBF algorithm can be used for any arbitrary sampling density for training samples and is derived from a rigorous statistical point of view. Simulation results for bench mark problems in the function approximation area show that the GGAP-RBF outperforms several other sequential learning algorithms in terms of learning speed, network size and generalization performance regardless of the sampling density function of the training data.     

A fault-tolerant regularizer for RBF networks.

In classical training methods for node open fault, we need to consider many potential faulty networks. When the multinode fault situation is considered, the space of potential faulty networks is very large. Hence, the objective function and the corresponding learning algorithm would be computationally complicated. This paper uses the Kullback-Leibler divergence to define an objective function for improving the fault tolerance of radial basis function (RBF) networks. With the assumption that there is a Gaussian distributed noise term in the output data, a regularizer in the objective function is identified. Finally, the corresponding learning algorithm is developed. In our approach, the objective function and the learning algorithm are computationally simple. Compared with some conventional approaches, including weight-decay-based regularizers, our approach has a better fault-tolerant ability. Besides, our empirical study shows that our approach can improve the generalization ability of a fault-free RBF network.     

Error-driven active learning in growing radial basis function networks for early robot learning

In this paper, we describe a new error-driven active learning approach to self-growing radial basis function networks for early robot learning. There are several mappings that need to be set up for an autonomous robot system for sensorimotor coordination and transformation of sensory information from one modality to another, and these mappings are usually highly nonlinear. Traditional passive learning approaches usually cause both large mapping errors and nonuniform mapping error distribution compared to active learning. A hierarchical clustering technique is introduced to group large mapping errors and these error clusters drive the system to actively explore details of these clusters. Higher level local growing radial basis function subnetworks are used to approximate the residual errors from previous mapping levels. Plastic radial basis function networks construct the substrate of the learning system and a simplified node-decoupled extended Kalman filter algorithm is presented to train these radial basis function networks. Experimental results are given to compare the performance among active learning with hierarchical adaptive RBF networks, passive learning with adaptive RBF networks and hierarchical mixtures of experts, as well as their robustness under noise conditions.     

在线学习RBF神经网络的模型参考自适应控制器

本文给出一种在线学习RBF神经网络的快速算法,并设计了在线学习RBF神经网络的MARAC。通过仿真表明,在线RBF神经网络的MRAC计算量小、在线学习、跟踪时间短、控制精度高的优点。     

在线学习RBF神经网络的模型参考自适应控制器

本文给出一种在线学习RBF神经网络的快速算法,并设计了在线学习RBF神经网络的MARAC。通过仿真表明,在线RBF神经网络的MRAC计算量小、在线学习、跟踪时间短、控制精度高的优点。     

自适应RBF-LBF串联神经网络结构与参数优化方法

研究了前向单层径基函数(RBF)网络和前向单层线性基本函数(LBF)网络的分类机理，提出了RBF的中心和宽度应通过学习自动确定，在学习过程中根据错分样本被错分入的类别自动生成新的核函数这一观点．如果两个或两个以上核函数属于同一类，在输入空间相距较近且未被其它类别的样本分隔开来的情况下，则应考虑将之合并，或者使它们的作用区域部分重叠．从理论上阐明了采用Sigmoid活化函数的单层感知器的分类阈值为0．5，进而提出了由单层RBF网络和单层感知器组成的串联RBF—LBF神经网络．文中详细给出了确定该串联RBF—LBF神经网络结构、核函数个数、位置与宽度的优化算法．一般来说，该算法的计算复杂性比前向单隐层感知器采用的误差反传算法要小或至少相当．对几个经典的模式分类难题的处理结果表明，与一般RBF网络和前向单隐层感知器网络相比，该串联RBF—LBF网络及其自适应学习算法具有收敛速度快，分类精度高，易于得到最小结构，在学习过程中不易陷入局部极小点等优点，有利于实现实时分析．实验结果同时也验证了单层LBF网络对提高RBF—LBF网络分类正确率的重要性．     

Dynamic fuzzy neural networks-a novel approach to functionapproximation

In this paper, an architecture of dynamic fuzzy neural networks (D-FNN) implementing Takagi-Sugeno-Kang (TSK) fuzzy systems based on extended radial basis function (RBF) neural networks is proposed. A novel learning algorithm based on D-FNN is also presented. The salient characteristics of the algorithm are: 1) hierarchical on-line self-organizing learning is used; 2) neurons can be recruited or deleted dynamically according to their significance to the system's performance; and 3) fast learning speed can be achieved. Simulation studies and comprehensive comparisons with some other learning algorithms demonstrate that a more compact structure with higher performance can be achieved by the proposed approach.     

一种径向基函数神经网络预测在超临界温度控制系统中的应用研究

超临界温度控制系统具有较大的惯性、时滞和非线性,且动态特性随运行工况而改变,难以建立其精确的数学模型,本文采用GGAP算法的RBF神经网络构成神经网络预测控制器,将在线学习和预测控制相结合,以某超临界电厂主汽温度为研究对象,MATLAB仿真实验表明,该方法能对超临界温度控制系统实现有效的控制,动态性能较传统的PID控制有较大的提高。     

基于径向基函数的多帧图像超分辨重建算法

神经网络具有强大的非线性学习能力,基于神经网络的多帧超分辨重建方法获得了初步研究,但这些方法一般只能应用于帧间具有标准位移的控制成像情形,难以推广应用到其他实际情况。为了将神经网络强大的学习能力应用到非控制成像多帧超分辨重建中,以获得更好的超分辨效果,提出了一种利用径向基函数(RBF)神经网络进行解模糊的算法,并将其与多帧非均匀插值结合起来,形成了一种新的两步超分辨算法。仿真实验结果表明,该算法的结构相似度为0.55～0.7。该算法不但扩展了RBF神经网络的应用范围,还获得了更好的超分辨性能。