Abstract
Given the number of additional neurons, we have estimated a lower bound of memory capacity of bidirectional associative memory (BAM) with dummy augmentation encoding (DAE). The lower bound is min(LA(1+rca)2/4 log LA, LB(1+rdb)2/4 log LB), where (LA, LB) are the original dimensions of the library pairs (Ak, Bk), and the numbers of additional neurons are denoted as rcaLA and rdbLB (rca and rdb are positive constants.). The extension of our result on Hopfield network with DAE is also discussed. Finally, on the basis of the lower bound, we have evaluated the efficiency of DAE.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Joint Conference on Neural Networks |
| Publisher | IEEE |
| Pages | 2674-2677 |
| Volume | 3 |
| ISBN (Print) | 0780314212, 9780780314214 |
| Publication status | Published - 1993 |
| Externally published | Yes |
| Event | Proceedings of 1993 International Joint Conference on Neural Networks. Part 1 (of 3) - Nagoya, Japan Duration: 25 Oct 1993 → 29 Oct 1993 https://ewh.ieee.org/conf/ijcnn/1993/ijcnn-1993Oct.pdf |
Publication series
| Name | |
|---|---|
| Volume | 3 |
Conference
| Conference | Proceedings of 1993 International Joint Conference on Neural Networks. Part 1 (of 3) |
|---|---|
| Place | Japan |
| City | Nagoya |
| Period | 25/10/93 → 29/10/93 |
| Internet address |
Fingerprint
Dive into the research topics of 'Performance of dummy augmentation encoding'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver