DocumentCode
1711770
Title
The dynamic threshold of semi-orthogonal associative memory model
Author
Huang, Xinmin ; Miyazaki, Yasumitsu
Author_Institution
Dept. of Inf. & Comput. Sci., Toyohashi Univ. of Technol., Japan
fYear
1996
Firstpage
710
Lastpage
715
Abstract
Discusses the fundamental properties of state evolution in the recalling processes of the semi-orthogonal associative memory (SAM) model and derives the optimum dynamic threshold of a SAM. In a probabilistic sense, there is a convergence criterion Qν in the SAM such that, for arbitrary initial input, the recalling outputs converge to the desired pattern on this input when the effective Hamming distance between the desired pattern and the initial input is no larger than (1-Qν)N, but the attracting basins of stable states in this model are strange. It is proved that the strange attracting basins can be improved by introducing a dynamic threshold into this model. Making use of the statistical neurodynamics, the optimum dynamic threshold is given and its efficiency is investigated
Keywords
Hamming codes; content-addressable storage; convergence; nonlinear dynamical systems; optimisation; statistics; Hamming distance; convergence criterion; initial input; optimum dynamic threshold; recalling processes; semi-orthogonal associative memory model; stable states; state evolution; statistical neurodynamics; strange attracting basins; Associative memory; Convergence; Equations; Magnesium compounds; Neurodynamics; Neurofeedback; Neurons; Pattern recognition; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1996., Proceedings of IEEE International Conference on
Conference_Location
Nagoya
Print_ISBN
0-7803-2902-3
Type
conf
DOI
10.1109/ICEC.1996.542689
Filename
542689
Link To Document