Hopfield联想记忆设计的新方法

J. Hao, S. Tan, J. Vandewalle
{"title":"Hopfield联想记忆设计的新方法","authors":"J. Hao, S. Tan, J. Vandewalle","doi":"10.1109/IJCNN.1991.170666","DOIUrl":null,"url":null,"abstract":"The authors present a novel method for constructing the weight matrix for the Hopfield associative memory. The most important feature of this method is the explicit introduction of the size of the attraction basin to be a main design parameter, and the weight matrix is obtained as a result of optimizing this parameter. Another feature is that all the connection weights can only assume three different values, -1, +1, and 0, which facilitates the VLSI implementation of the weights. Compared to the widely used Hebbian rule, the method can guarantee all the given patterns to be stored at least as fixed points, regardless of the internal structure of the patterns. The proposed design method is illustrated by a few examples.<<ETX>>","PeriodicalId":211135,"journal":{"name":"[Proceedings] 1991 IEEE International Joint Conference on Neural Networks","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1991-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A new approach to the design of Hopfield associative memory\",\"authors\":\"J. Hao, S. Tan, J. Vandewalle\",\"doi\":\"10.1109/IJCNN.1991.170666\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present a novel method for constructing the weight matrix for the Hopfield associative memory. The most important feature of this method is the explicit introduction of the size of the attraction basin to be a main design parameter, and the weight matrix is obtained as a result of optimizing this parameter. Another feature is that all the connection weights can only assume three different values, -1, +1, and 0, which facilitates the VLSI implementation of the weights. Compared to the widely used Hebbian rule, the method can guarantee all the given patterns to be stored at least as fixed points, regardless of the internal structure of the patterns. The proposed design method is illustrated by a few examples.<<ETX>>\",\"PeriodicalId\":211135,\"journal\":{\"name\":\"[Proceedings] 1991 IEEE International Joint Conference on Neural Networks\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-11-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] 1991 IEEE International Joint Conference on Neural Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IJCNN.1991.170666\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] 1991 IEEE International Joint Conference on Neural Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCNN.1991.170666","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种构造Hopfield联想记忆权矩阵的新方法。该方法最大的特点是明确引入吸引池的大小作为主要设计参数,并通过对该参数的优化得到权重矩阵。另一个特点是,所有的连接权重只能假设三个不同的值,-1、+1和0,这有利于权重的VLSI实现。与广泛使用的Hebbian规则相比,该方法可以保证所有给定的模式至少作为定点存储,而不考虑模式的内部结构。通过几个实例说明了所提出的设计方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A new approach to the design of Hopfield associative memory
The authors present a novel method for constructing the weight matrix for the Hopfield associative memory. The most important feature of this method is the explicit introduction of the size of the attraction basin to be a main design parameter, and the weight matrix is obtained as a result of optimizing this parameter. Another feature is that all the connection weights can only assume three different values, -1, +1, and 0, which facilitates the VLSI implementation of the weights. Compared to the widely used Hebbian rule, the method can guarantee all the given patterns to be stored at least as fixed points, regardless of the internal structure of the patterns. The proposed design method is illustrated by a few examples.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Control of a robotic manipulating arm by a neural network simulation of the human cerebral and cerebellar cortical processes Neural network training using homotopy continuation methods A learning scheme of neural networks which improves accuracy and speed of convergence using redundant and diversified network structures The abilities of neural networks to abstract and to use abstractions Backpropagation based on the logarithmic error function and elimination of local minima
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1