DocumentCode :
2657235
Title :
Training weighted associative memories by global minimization
Author :
Wang, Tao ; Xing, Xiaoliang ; Lu, Fang
Author_Institution :
Dept. of Comput. Sci. & Eng., Zhejiang Univ., Hangzhou, China
fYear :
1991
fDate :
18-21 Nov 1991
Firstpage :
2466
Abstract :
A training strategy in a weighted associative memory (WAM) by means of global minimization is presented. The WAM emphasizes the association among patterns by imposing weights on patterns. A cost function that gives a quantitative measure of the goodness of the WAM is derived to convert the problem of finding the weights into a global minimisation, which can be solved by a gradient descent algorithm. The authors investigate the existence of the weights, prove the convergence of the training strategy, and discuss the asymptotic stability of each desired pattern and its domain of attraction. Experimental results are described
Keywords :
content-addressable storage; learning systems; minimisation; asymptotic stability; convergence; global minimization; gradient descent algorithm; training strategy; weighted associative memory; Associative memory; Asymptotic stability; Computer science; Convergence; Cost function; Information retrieval; Minimization methods; Network topology; Neural networks; Sufficient conditions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 1991. 1991 IEEE International Joint Conference on
Print_ISBN :
0-7803-0227-3
Type :
conf
DOI :
10.1109/IJCNN.1991.170759
Filename :
170759
Link To Document :
بازگشت