| Min-max 模糊 Hopfield 网络的一个基于容错性的学习算法 |
| |
| 引用本文： | 刘普寅.Min-max 模糊 Hopfield 网络的一个基于容错性的学习算法[J].国防科技大学学报,1998,20(1):109-114. |
| |
| 作者姓名： | 刘普寅 |
| |
| 作者单位： | 长沙国防科技大学系统工程与数学系!长沙，410073 |
| |
| 摘 要： | 在一定的条件下证明了Min－max模糊Hopfield网络吸引子的吸引域随着连接权矩阵的减小而增大，在此基础上，设计了一个基于容错性的学习算法。在一定的意义下，用该学习算法得到的矩阵最小，从而此时系统具有最优容错性。最后用实例验证了结论。
|
| 关 键 词： | Min—max模糊Hopfield网络 容错性 吸引子 吸引域 |
| 收稿时间： | 1997/4/15 0:00:00 |
A Learning Algorithm Based on Fault-tolerance for Min-max Fuzzy Hopfield Networks |
| |
| Liu Puyin.A Learning Algorithm Based on Fault-tolerance for Min-max Fuzzy Hopfield Networks[J].Journal of National University of Defense Technology,1998,20(1):109-114. |
| |
| Authors: | Liu Puyin |
| |
| Abstract: | In the paper, we prove under some conditions, that the attractive basin of the attractorof min-max fuzzy Hopfield network increases when the connected weighted matrix decreases. In accordance with this conclusion,we design a learning algorithm based on the fault-tolerance of the network,the matrix obtained by the learning algorithm is minimum, consequently, the fault-tolerance of the network is optimal. Finally, the example demonstrates our conclusions. |
| |
| Keywords: | Min-max fuzzy Hopfield network fault-tolerance attractor attractive basin |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
|
点击此处可从《国防科技大学学报》下载全文 |
