首页> 外文会议>International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery >A Review of the Theory and Method for New Developed Feedforward Neural Networks
【24h】

A Review of the Theory and Method for New Developed Feedforward Neural Networks

机译:新发达的前馈神经网络理论与方法述评

获取原文

摘要

Two new theories and methods of feedforward neural network developed in recent years are systematically reviewed. They are Algebraic Algorithm of feedforward neural network and Spline Weight Function Algorithm of feedforward neural network. The network structure, basic theory and algorithm, and basic performance of the two networks are described. The algebraic algorithm of feedforward neural network can get the global optimum, but BP algorithm is difficult to get the global optimum. Algebraic algorithm has high accuracy and fast training speed. In engineering application, the algebraic algorithm gives the calculation formula of accurately determining the number of hidden layer neurons, but the BP algorithm does not give such an accurate formula. However, algebraic algorithm, like traditional BP algorithm, obtains constant weights, which is difficult to reflect the information of training samples. The spline weight function algorithm of feedforward neural network not only retains the advantages of algebraic algorithm, but also overcomes its shortcomings, so that the weight of trained neural network is a function of input sample (called weight function), which is composed of spline function, not a constant of traditional method. The trained weight function can extract useful information features from the trained samples. The topological structure of the spline weighted neural network is very simple, and the number of its neurons is independent of the number of samples, which is equal to the number of input and output nodes. The calculation speed is fast. Moreover, with the increase of the number of samples, the generalization ability of the network is also improving.
机译:两个新的理论和近年来发展起来的前馈神经网络的方法进行了系统的回顾。他们是前馈神经网络的代数算法和前馈神经网络的样条权函数算法。网络结构的基本理论和算法,并且这两个网络的基本性能进行说明。前馈神经网络的代数算法可以得到全局最优,但BP算法是很难得到全局最优解。代数算法具有精度高,训练速度快。在工程应用中,代数算法给出的精确确定隐藏层神经元的数目的计算公式,但BP算法不提供这样一个准确的公式。然而,代数算法,像传统的BP算法,获得恒定的重量,这是难以体现训练样本的信息。前馈神经网络的花键权函数算法不仅保留代数算法的优点,而且克服了它的缺点,使训练的神经网络的权重是输入样品(称为加权函数),这是由样条函数的函数,而不是传统方法的常数。经训练的权重函数可以提取从训练样本的有用信息的特征。花键加权神经网络的拓扑结构是很简单的,并且它的神经元的数目是独立的样本的数目,其等于输入和输出节点的数目。计算速度快。此外,与样本的数目的增加,网络的推广能力也在提高。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号