摘要
讨论了用离散的带反馈的Ｈｏｐｆｉｅｌｄ网络的极限环来表达概念，以及在给定不动点、极限环或迭代序列等限制下，用线性规划和遗传算法通过求解不等式组一般性地建立Ｈｏｐｆｉｅｌｄ网络的方法，从而也解决了网络联结的稀释问题。最后给出了几个实例。
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.
出处
《自动化学报》
EI
CSCD
北大核心
1996年第3期301-308,共8页
Acta Automatica Sinica
关键词
极限环
椭球法
遗传算法
神经网络
Hopfield Networks
limit cycles
ellipsoid method
genetic algorithms
dilution of connections.
