智能信息处理的神经联想记忆

M. Hattori, M. Hagiwara
{"title":"智能信息处理的神经联想记忆","authors":"M. Hattori, M. Hagiwara","doi":"10.1109/KES.1998.725937","DOIUrl":null,"url":null,"abstract":"In this paper, first we derive a novel relaxation method for the system of linear inequalities and apply it to the learning for associative memories. Since the proposed intersection learning can guarantee the recall of all training data, it can greatly enlarge the storage capacity of associative memories. In addition, it requires much less weights renewal times than the conventional methods. We also propose a multimodule associative memory which can be learned by the intersection learning algorithm. The proposed associative memory can deal with many-to-many associations and it is applied to a knowledge processing task. Computer simulation results show the effectiveness of the proposed learning algorithm and associative memory.","PeriodicalId":394492,"journal":{"name":"1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Neural associative memory for intelligent information processing\",\"authors\":\"M. Hattori, M. Hagiwara\",\"doi\":\"10.1109/KES.1998.725937\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, first we derive a novel relaxation method for the system of linear inequalities and apply it to the learning for associative memories. Since the proposed intersection learning can guarantee the recall of all training data, it can greatly enlarge the storage capacity of associative memories. In addition, it requires much less weights renewal times than the conventional methods. We also propose a multimodule associative memory which can be learned by the intersection learning algorithm. The proposed associative memory can deal with many-to-many associations and it is applied to a knowledge processing task. Computer simulation results show the effectiveness of the proposed learning algorithm and associative memory.\",\"PeriodicalId\":394492,\"journal\":{\"name\":\"1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-04-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KES.1998.725937\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KES.1998.725937","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文首先推导了线性不等式系统的一种新的松弛方法,并将其应用于联想记忆的学习。由于所提出的交叉学习可以保证所有训练数据的召回,因此可以极大地扩大联想记忆的存储容量。此外,它比传统方法需要更少的权重更新时间。我们还提出了一种可通过交叉学习算法学习的多模块联想记忆。提出的联想记忆可以处理多对多的关联,并应用于知识处理任务。计算机仿真结果表明了所提出的学习算法和联想记忆的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Neural associative memory for intelligent information processing
In this paper, first we derive a novel relaxation method for the system of linear inequalities and apply it to the learning for associative memories. Since the proposed intersection learning can guarantee the recall of all training data, it can greatly enlarge the storage capacity of associative memories. In addition, it requires much less weights renewal times than the conventional methods. We also propose a multimodule associative memory which can be learned by the intersection learning algorithm. The proposed associative memory can deal with many-to-many associations and it is applied to a knowledge processing task. Computer simulation results show the effectiveness of the proposed learning algorithm and associative memory.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信