检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《软件学报》1995年第7期440-448,共9页Journal of Software
基 金:攀登计划;863高技术计划的资助
摘 要:本文提出多层前馈网络的一种新的学习和综合算法──FP算法,并证明由此算法得到的网络作为通用联想记忆器时,具有如下优点:(1)每个样本都是吸引中心;(2)每个样本的吸引半径达到最大值;(3)网络没有假吸引中心;(4)网络具有最少的元件个数;(5)学习的复杂性达到最优(就其复杂性的阶而言).故此网络在性能、结构、计算复杂性等方面均达到很好状态.A new learning algorithm-forward propagation (FP) of multilayered feed-forward neural networks is presented in this paper. The authors show that as an associative memory the network constructed by the FP algorithm has several advantages. (1)Each training sample is an attractive center. (2) The attractive radius of each training sample reaches the maximum. (3) There is no spurious attractive center in the network.(4) The network has minimal number of elements. (5) The order of its learning complexity is optimal. The FP learning algorithm is also an effective synthesis tool, i. e., the network architecture can be constructed during its learning process.
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.217.212.222