{"title":"基于约束反向传播学习的复杂度为0 (N)的Hopfield网络","authors":"G. Martinelli, R. Prefetti","doi":"10.1109/IJCNN.1991.170606","DOIUrl":null,"url":null,"abstract":"A novel associative memory model is presented, which is derived from the Hopfield discrete neural network. Its architecture is greatly simplified because the number of interconnections grows only linearly with the dimensionality of the stored patterns. It makes use of a modified backpropagation algorithm as a learning tool. During the retrieval phase the network operates as an autoassociative BAM (directional associative memory), which searches for a minimum of an appropriate energy function. Computer simulations point out the good performances of the proposed learning method in terms of capacity and number of spurious stable states.<<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\":\"Hopfield network with O(N) complexity using a constrained backpropagation learning\",\"authors\":\"G. Martinelli, R. Prefetti\",\"doi\":\"10.1109/IJCNN.1991.170606\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel associative memory model is presented, which is derived from the Hopfield discrete neural network. Its architecture is greatly simplified because the number of interconnections grows only linearly with the dimensionality of the stored patterns. It makes use of a modified backpropagation algorithm as a learning tool. During the retrieval phase the network operates as an autoassociative BAM (directional associative memory), which searches for a minimum of an appropriate energy function. Computer simulations point out the good performances of the proposed learning method in terms of capacity and number of spurious stable states.<<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.170606\",\"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.170606","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hopfield network with O(N) complexity using a constrained backpropagation learning
A novel associative memory model is presented, which is derived from the Hopfield discrete neural network. Its architecture is greatly simplified because the number of interconnections grows only linearly with the dimensionality of the stored patterns. It makes use of a modified backpropagation algorithm as a learning tool. During the retrieval phase the network operates as an autoassociative BAM (directional associative memory), which searches for a minimum of an appropriate energy function. Computer simulations point out the good performances of the proposed learning method in terms of capacity and number of spurious stable states.<>