| 建立Hopfield网络的一般方法 |
| |
| 引用本文： | 刘晓鸿,戴汝为.建立Hopfield网络的一般方法[J].自动化学报,1996,22(3):301-307. |
| |
| 作者姓名： | 刘晓鸿 戴汝为 |
| |
| 作者单位： | 1.北京邮电大学计算机系,北京; |
| |
| 摘 要： | 讨论了用离散的带反馈的Hopfield网络的极限环来表达概念,以及在给定不动点、极限
环或迭代序列等限制下,用线性规划和遗传算法通过求解不等式组一般性地建立Hopfield网
络的方法,从而也解决了网络联结的稀释问题.最后给出了几个实例,
|
| 关 键 词： | Hopfield网络 极限环 椭球法 遗传算法 联结的稀释 |
| 收稿时间： | 1994-3-10 |
General Methods of Construction of Hopfield Neural Networks |
| |
| Liu Xiaohong,Dai Ruwei.General Methods of Construction of Hopfield Neural Networks[J].Acta Automatica Sinica,1996,22(3):301-307. |
| |
| Authors: | Liu Xiaohong Dai Ruwei |
| |
| Affiliation: | 1.Dept.of Computer Engr.,Beijing Univ.of Post & Teleco,Beijing;Institute of Automation,Academia Sinica,Beijing |
| |
| Abstract: | In this paper, we discusses the concept representation with limit cycles in the discrete recurrent Hopfield Networks. We also consider the construction of a Hopfield Network with linear programming and genetic algorithms by solving inequality systems, under constraints of fixed points, limit cycles and iteration sequences, and thus solve the problem of dilution of connections. Finally, some examples are given. |
| |
| Keywords: | Hopfield Networks limit cycles ellipsoid method genetic algorithms dilution of connections |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《自动化学报》浏览原始摘要信息 |
|
点击此处可从《自动化学报》下载全文 |
|
