Designing asymmetric Hopfield-type associative memory with higher order hamming stability
The problem of optimal asymmetric Hopfield-type associative memory (HAM) design based on perceptron-type learning algorithms is considered. It is found that most of the existing methods considered the design problem as either 1) finding optimal hyperplanes according to normal distance from the proto...
Gespeichert in:
Veröffentlicht in: | IEEE transaction on neural networks and learning systems 2005-11, Vol.16 (6), p.1464-1476 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1476 |
---|---|
container_issue | 6 |
container_start_page | 1464 |
container_title | IEEE transaction on neural networks and learning systems |
container_volume | 16 |
creator | Donq-Liang Lee Chuang, T.C. |
description | The problem of optimal asymmetric Hopfield-type associative memory (HAM) design based on perceptron-type learning algorithms is considered. It is found that most of the existing methods considered the design problem as either 1) finding optimal hyperplanes according to normal distance from the prototype vectors to the hyperplane surface or 2) obtaining weight matrix W=[w/sub ij/] by solving a constraint optimization problem. In this paper, we show that since the state space of the HAM consists of only bipolar patterns, i.e., V=(v/sub 1/,v/sub 2/,...,v/sub N/)/sup T//spl isin/{-1,+1}/sup N/, the basins of attraction around each prototype (training) vector should be expanded by using Hamming distance measure. For this reason, in this paper, the design problem is considered from a different point of view. Our idea is to systematically increase the size of the training set according to the desired basin of attraction around each prototype vector. We name this concept the higher order Hamming stability and show that conventional minimum-overlap algorithm can be modified to incorporate this concept. Experimental results show that the recall capability as well as the number of spurious memories are all improved by using the proposed method. Moreover, it is well known that setting all self-connections w/sub ii//spl forall/i to zero has the effect of reducing the number of spurious memories in state space. From the experimental results, we find that the basin width around each prototype vector can be enlarged by allowing nonzero diagonal elements on learning of the weight matrix W. If the magnitude of w/sub ii/ is small for all i, then the condition w/sub ii/=0/spl forall/i can be relaxed without seriously affecting the number of spurious memories in the state space. Therefore, the method proposed in this paper can be used to increase the basin width around each prototype vector with the cost of slightly increasing the number of spurious memories in the state space. |
doi_str_mv | 10.1109/TNN.2005.852863 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_pubmed_primary_16342488</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1528524</ieee_id><sourcerecordid>68887891</sourcerecordid><originalsourceid>FETCH-LOGICAL-c404t-83d10dab2042fdb4aa97b7e0436e4b895c52350588e1260863530a40f5cef15b3</originalsourceid><addsrcrecordid>eNqF0c9r2zAUB3AxVtY023mHQjGU7ub06ZctHUt_LIXSXbrDTkaWnxMFy84kp8P__RQSCOyyiyR4H73H40vIVwoLSkHfvr2-LhiAXCjJVME_kBnVguYAmn9MbxAy14yV5-Qixg0AFRKKT-ScFlwwodSM_HrA6Fa961eZiZP3OAZns-WwbR12TT5OW0yFOFhnRveOmUc_hCn748Z1tnarNYZsCE0618b7fZc4mtp1bpw-k7PWdBG_HO85-fn0-Ha_zF9-fH--v3vJrQAx5oo3FBpTMxCsbWphjC7rEkHwAkWttLSScQlSKaSsgLSk5GAEtNJiS2XN5-Tboe82DL93GMfKu2ix60yPwy5WhVKqVJr-F7JSa6EKmeD1P3Az7EKflqgoUFWoUvC9uj0oG4YYA7bVNjhvwpRQtQ-nSuFU-3CqQzjpx9Wx76722Jz8MY0Ebo7ARGu6NpjeunhyJSuZAEju8uAcIp7KaYpkgv8FdG-fRg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1018687435</pqid></control><display><type>article</type><title>Designing asymmetric Hopfield-type associative memory with higher order hamming stability</title><source>IEEE Electronic Library (IEL)</source><creator>Donq-Liang Lee ; Chuang, T.C.</creator><creatorcontrib>Donq-Liang Lee ; Chuang, T.C.</creatorcontrib><description>The problem of optimal asymmetric Hopfield-type associative memory (HAM) design based on perceptron-type learning algorithms is considered. It is found that most of the existing methods considered the design problem as either 1) finding optimal hyperplanes according to normal distance from the prototype vectors to the hyperplane surface or 2) obtaining weight matrix W=[w/sub ij/] by solving a constraint optimization problem. In this paper, we show that since the state space of the HAM consists of only bipolar patterns, i.e., V=(v/sub 1/,v/sub 2/,...,v/sub N/)/sup T//spl isin/{-1,+1}/sup N/, the basins of attraction around each prototype (training) vector should be expanded by using Hamming distance measure. For this reason, in this paper, the design problem is considered from a different point of view. Our idea is to systematically increase the size of the training set according to the desired basin of attraction around each prototype vector. We name this concept the higher order Hamming stability and show that conventional minimum-overlap algorithm can be modified to incorporate this concept. Experimental results show that the recall capability as well as the number of spurious memories are all improved by using the proposed method. Moreover, it is well known that setting all self-connections w/sub ii//spl forall/i to zero has the effect of reducing the number of spurious memories in state space. From the experimental results, we find that the basin width around each prototype vector can be enlarged by allowing nonzero diagonal elements on learning of the weight matrix W. If the magnitude of w/sub ii/ is small for all i, then the condition w/sub ii/=0/spl forall/i can be relaxed without seriously affecting the number of spurious memories in the state space. Therefore, the method proposed in this paper can be used to increase the basin width around each prototype vector with the cost of slightly increasing the number of spurious memories in the state space.</description><identifier>ISSN: 1045-9227</identifier><identifier>ISSN: 2162-237X</identifier><identifier>EISSN: 1941-0093</identifier><identifier>EISSN: 2162-2388</identifier><identifier>DOI: 10.1109/TNN.2005.852863</identifier><identifier>PMID: 16342488</identifier><identifier>CODEN: ITNNEP</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithm design and analysis ; Algorithms ; Applied sciences ; Artificial intelligence ; Associative memory ; Asymmetric Hopfield-type associative memory ; basin of attraction ; Biomimetics - methods ; Computer science; control theory; systems ; Computer Simulation ; Connectionism. Neural networks ; Design methodology ; Equations ; Exact sciences and technology ; Hamming stability ; Memory ; minimum overlap algorithm ; Models, Theoretical ; Neural networks ; Neural Networks (Computer) ; Neurons ; Pattern Recognition, Automated - methods ; perceptron-type learning algorithm ; Prototypes ; Signal Processing, Computer-Assisted ; Stability ; State-space methods ; Studies ; Symmetric matrices ; Time Factors</subject><ispartof>IEEE transaction on neural networks and learning systems, 2005-11, Vol.16 (6), p.1464-1476</ispartof><rights>2006 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2005</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c404t-83d10dab2042fdb4aa97b7e0436e4b895c52350588e1260863530a40f5cef15b3</citedby><cites>FETCH-LOGICAL-c404t-83d10dab2042fdb4aa97b7e0436e4b895c52350588e1260863530a40f5cef15b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1528524$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1528524$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17272400$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/16342488$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Donq-Liang Lee</creatorcontrib><creatorcontrib>Chuang, T.C.</creatorcontrib><title>Designing asymmetric Hopfield-type associative memory with higher order hamming stability</title><title>IEEE transaction on neural networks and learning systems</title><addtitle>TNN</addtitle><addtitle>IEEE Trans Neural Netw</addtitle><description>The problem of optimal asymmetric Hopfield-type associative memory (HAM) design based on perceptron-type learning algorithms is considered. It is found that most of the existing methods considered the design problem as either 1) finding optimal hyperplanes according to normal distance from the prototype vectors to the hyperplane surface or 2) obtaining weight matrix W=[w/sub ij/] by solving a constraint optimization problem. In this paper, we show that since the state space of the HAM consists of only bipolar patterns, i.e., V=(v/sub 1/,v/sub 2/,...,v/sub N/)/sup T//spl isin/{-1,+1}/sup N/, the basins of attraction around each prototype (training) vector should be expanded by using Hamming distance measure. For this reason, in this paper, the design problem is considered from a different point of view. Our idea is to systematically increase the size of the training set according to the desired basin of attraction around each prototype vector. We name this concept the higher order Hamming stability and show that conventional minimum-overlap algorithm can be modified to incorporate this concept. Experimental results show that the recall capability as well as the number of spurious memories are all improved by using the proposed method. Moreover, it is well known that setting all self-connections w/sub ii//spl forall/i to zero has the effect of reducing the number of spurious memories in state space. From the experimental results, we find that the basin width around each prototype vector can be enlarged by allowing nonzero diagonal elements on learning of the weight matrix W. If the magnitude of w/sub ii/ is small for all i, then the condition w/sub ii/=0/spl forall/i can be relaxed without seriously affecting the number of spurious memories in the state space. Therefore, the method proposed in this paper can be used to increase the basin width around each prototype vector with the cost of slightly increasing the number of spurious memories in the state space.</description><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Associative memory</subject><subject>Asymmetric Hopfield-type associative memory</subject><subject>basin of attraction</subject><subject>Biomimetics - methods</subject><subject>Computer science; control theory; systems</subject><subject>Computer Simulation</subject><subject>Connectionism. Neural networks</subject><subject>Design methodology</subject><subject>Equations</subject><subject>Exact sciences and technology</subject><subject>Hamming stability</subject><subject>Memory</subject><subject>minimum overlap algorithm</subject><subject>Models, Theoretical</subject><subject>Neural networks</subject><subject>Neural Networks (Computer)</subject><subject>Neurons</subject><subject>Pattern Recognition, Automated - methods</subject><subject>perceptron-type learning algorithm</subject><subject>Prototypes</subject><subject>Signal Processing, Computer-Assisted</subject><subject>Stability</subject><subject>State-space methods</subject><subject>Studies</subject><subject>Symmetric matrices</subject><subject>Time Factors</subject><issn>1045-9227</issn><issn>2162-237X</issn><issn>1941-0093</issn><issn>2162-2388</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><sourceid>EIF</sourceid><recordid>eNqF0c9r2zAUB3AxVtY023mHQjGU7ub06ZctHUt_LIXSXbrDTkaWnxMFy84kp8P__RQSCOyyiyR4H73H40vIVwoLSkHfvr2-LhiAXCjJVME_kBnVguYAmn9MbxAy14yV5-Qixg0AFRKKT-ScFlwwodSM_HrA6Fa961eZiZP3OAZns-WwbR12TT5OW0yFOFhnRveOmUc_hCn748Z1tnarNYZsCE0618b7fZc4mtp1bpw-k7PWdBG_HO85-fn0-Ha_zF9-fH--v3vJrQAx5oo3FBpTMxCsbWphjC7rEkHwAkWttLSScQlSKaSsgLSk5GAEtNJiS2XN5-Tboe82DL93GMfKu2ix60yPwy5WhVKqVJr-F7JSa6EKmeD1P3Az7EKflqgoUFWoUvC9uj0oG4YYA7bVNjhvwpRQtQ-nSuFU-3CqQzjpx9Wx76722Jz8MY0Ebo7ARGu6NpjeunhyJSuZAEju8uAcIp7KaYpkgv8FdG-fRg</recordid><startdate>20051101</startdate><enddate>20051101</enddate><creator>Donq-Liang Lee</creator><creator>Chuang, T.C.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7QF</scope><scope>7QO</scope><scope>7QP</scope><scope>7QQ</scope><scope>7QR</scope><scope>7SC</scope><scope>7SE</scope><scope>7SP</scope><scope>7SR</scope><scope>7TA</scope><scope>7TB</scope><scope>7TK</scope><scope>7U5</scope><scope>8BQ</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>H8D</scope><scope>JG9</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>P64</scope><scope>7X8</scope></search><sort><creationdate>20051101</creationdate><title>Designing asymmetric Hopfield-type associative memory with higher order hamming stability</title><author>Donq-Liang Lee ; Chuang, T.C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c404t-83d10dab2042fdb4aa97b7e0436e4b895c52350588e1260863530a40f5cef15b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Associative memory</topic><topic>Asymmetric Hopfield-type associative memory</topic><topic>basin of attraction</topic><topic>Biomimetics - methods</topic><topic>Computer science; control theory; systems</topic><topic>Computer Simulation</topic><topic>Connectionism. Neural networks</topic><topic>Design methodology</topic><topic>Equations</topic><topic>Exact sciences and technology</topic><topic>Hamming stability</topic><topic>Memory</topic><topic>minimum overlap algorithm</topic><topic>Models, Theoretical</topic><topic>Neural networks</topic><topic>Neural Networks (Computer)</topic><topic>Neurons</topic><topic>Pattern Recognition, Automated - methods</topic><topic>perceptron-type learning algorithm</topic><topic>Prototypes</topic><topic>Signal Processing, Computer-Assisted</topic><topic>Stability</topic><topic>State-space methods</topic><topic>Studies</topic><topic>Symmetric matrices</topic><topic>Time Factors</topic><toplevel>online_resources</toplevel><creatorcontrib>Donq-Liang Lee</creatorcontrib><creatorcontrib>Chuang, T.C.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Aluminium Industry Abstracts</collection><collection>Biotechnology Research Abstracts</collection><collection>Calcium & Calcified Tissue Abstracts</collection><collection>Ceramic Abstracts</collection><collection>Chemoreception Abstracts</collection><collection>Computer and Information Systems Abstracts</collection><collection>Corrosion Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Neurosciences Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>MEDLINE - Academic</collection><jtitle>IEEE transaction on neural networks and learning systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Donq-Liang Lee</au><au>Chuang, T.C.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Designing asymmetric Hopfield-type associative memory with higher order hamming stability</atitle><jtitle>IEEE transaction on neural networks and learning systems</jtitle><stitle>TNN</stitle><addtitle>IEEE Trans Neural Netw</addtitle><date>2005-11-01</date><risdate>2005</risdate><volume>16</volume><issue>6</issue><spage>1464</spage><epage>1476</epage><pages>1464-1476</pages><issn>1045-9227</issn><issn>2162-237X</issn><eissn>1941-0093</eissn><eissn>2162-2388</eissn><coden>ITNNEP</coden><abstract>The problem of optimal asymmetric Hopfield-type associative memory (HAM) design based on perceptron-type learning algorithms is considered. It is found that most of the existing methods considered the design problem as either 1) finding optimal hyperplanes according to normal distance from the prototype vectors to the hyperplane surface or 2) obtaining weight matrix W=[w/sub ij/] by solving a constraint optimization problem. In this paper, we show that since the state space of the HAM consists of only bipolar patterns, i.e., V=(v/sub 1/,v/sub 2/,...,v/sub N/)/sup T//spl isin/{-1,+1}/sup N/, the basins of attraction around each prototype (training) vector should be expanded by using Hamming distance measure. For this reason, in this paper, the design problem is considered from a different point of view. Our idea is to systematically increase the size of the training set according to the desired basin of attraction around each prototype vector. We name this concept the higher order Hamming stability and show that conventional minimum-overlap algorithm can be modified to incorporate this concept. Experimental results show that the recall capability as well as the number of spurious memories are all improved by using the proposed method. Moreover, it is well known that setting all self-connections w/sub ii//spl forall/i to zero has the effect of reducing the number of spurious memories in state space. From the experimental results, we find that the basin width around each prototype vector can be enlarged by allowing nonzero diagonal elements on learning of the weight matrix W. If the magnitude of w/sub ii/ is small for all i, then the condition w/sub ii/=0/spl forall/i can be relaxed without seriously affecting the number of spurious memories in the state space. Therefore, the method proposed in this paper can be used to increase the basin width around each prototype vector with the cost of slightly increasing the number of spurious memories in the state space.</abstract><cop>New York, NY</cop><pub>IEEE</pub><pmid>16342488</pmid><doi>10.1109/TNN.2005.852863</doi><tpages>13</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1045-9227 |
ispartof | IEEE transaction on neural networks and learning systems, 2005-11, Vol.16 (6), p.1464-1476 |
issn | 1045-9227 2162-237X 1941-0093 2162-2388 |
language | eng |
recordid | cdi_pubmed_primary_16342488 |
source | IEEE Electronic Library (IEL) |
subjects | Algorithm design and analysis Algorithms Applied sciences Artificial intelligence Associative memory Asymmetric Hopfield-type associative memory basin of attraction Biomimetics - methods Computer science control theory systems Computer Simulation Connectionism. Neural networks Design methodology Equations Exact sciences and technology Hamming stability Memory minimum overlap algorithm Models, Theoretical Neural networks Neural Networks (Computer) Neurons Pattern Recognition, Automated - methods perceptron-type learning algorithm Prototypes Signal Processing, Computer-Assisted Stability State-space methods Studies Symmetric matrices Time Factors |
title | Designing asymmetric Hopfield-type associative memory with higher order hamming stability |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T12%3A31%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Designing%20asymmetric%20Hopfield-type%20associative%20memory%20with%20higher%20order%20hamming%20stability&rft.jtitle=IEEE%20transaction%20on%20neural%20networks%20and%20learning%20systems&rft.au=Donq-Liang%20Lee&rft.date=2005-11-01&rft.volume=16&rft.issue=6&rft.spage=1464&rft.epage=1476&rft.pages=1464-1476&rft.issn=1045-9227&rft.eissn=1941-0093&rft.coden=ITNNEP&rft_id=info:doi/10.1109/TNN.2005.852863&rft_dat=%3Cproquest_RIE%3E68887891%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1018687435&rft_id=info:pmid/16342488&rft_ieee_id=1528524&rfr_iscdi=true |