[Proceedings] 1991 IEEE International Joint Conference on Neural Networks 1991
DOI: 10.1109/ijcnn.1991.170760
|View full text |Cite
|
Sign up to set email alerts
|

Improving bidirectional associative memory performance by unlearning

Abstract: An encoding strategy for improving the noise tolerance and capacity of Kosko's bidirectional associative memory is proposed. Energy " a corresponding to pattem pairs that are to be stored are enhanced and simultaneously, unwanted or spurious states are eliminated. The method is an extension of the multiple training procedure that has been described in the literature for inducing local minima at desired locations. An additional unlearning term in the energy expression is included to eliminate spurious states. S… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1998
1998
2002
2002

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…4], for general information about associative memories, respectively, networks). During the years, various different strategies were proposed in order to design such networks (without claim of completeness we mention Grossberg [3], Anderson [1], Kohonen [8], Cohen and Grossberg [2], Kosko [10], [11], Hassoun [4], Wang et al [19], [20], Srinivasan and Chia [18], Shanmukh and Venkatesh [16], Zhang et al [22], Leung [14], [15], Wang et al [21], [23], and, finally, Sommer and Palm [17]) which proved to be suitable in different settings. In the following, we are especially interested in the idea proposed by Leung [15] classical perceptron learning rule for BAMs and proved a kind of optimality property for this new learning strategy (which he called bidirectional learning).…”
Section: Introductionmentioning
confidence: 99%
“…4], for general information about associative memories, respectively, networks). During the years, various different strategies were proposed in order to design such networks (without claim of completeness we mention Grossberg [3], Anderson [1], Kohonen [8], Cohen and Grossberg [2], Kosko [10], [11], Hassoun [4], Wang et al [19], [20], Srinivasan and Chia [18], Shanmukh and Venkatesh [16], Zhang et al [22], Leung [14], [15], Wang et al [21], [23], and, finally, Sommer and Palm [17]) which proved to be suitable in different settings. In the following, we are especially interested in the idea proposed by Leung [15] classical perceptron learning rule for BAMs and proved a kind of optimality property for this new learning strategy (which he called bidirectional learning).…”
Section: Introductionmentioning
confidence: 99%