A new neural network architecture with associative memory, pruning and order-sensitive learning.

作者: M. SREENIVASA RAO , ARUN K. PUJARI

DOI: 10.1142/S0129065799000332

关键词:

摘要: A new paradigm of neural network architecture is proposed that works as associative memory along with capabilities pruning and order-sensitive learning. The has a composite structure wherein each node the Hopfield by itself. employs an learning technique converges to user-specified stable states without having any spurious states. This based on geometrical energy function. so designed it allows in binary order progressively carries out retrieval. capacity 2n, where n number basic nodes network. are demonstrated experimenting three different application areas, namely Library Database, Protein Structure Database Natural Language Understanding.

参考文章(14)
Steven J. DeRose, Grammatical category disambiguation by statistical optimization Computational Linguistics. ,vol. 14, pp. 31- 39 ,(1988) , 10.5555/49084.49087
Julia Hirschberg, Diane Litman, Empirical studies on the disambiguation of cue phrases Computational Linguistics. ,vol. 19, pp. 501- 530 ,(1993) , 10.7916/D8PV6TGB
H. Shang, T.H. Merrettal, Tries for approximate string matching IEEE Transactions on Knowledge and Data Engineering. ,vol. 8, pp. 540- 547 ,(1996) , 10.1109/69.536247
E Gardner, H Gutfreund, I Yekutieli, The phase space of interactions in neural networks with definite symmetry Journal of Physics A. ,vol. 22, pp. 1995- 2008 ,(1989) , 10.1088/0305-4470/22/12/005
Stephen F. Altschul, Mark S. Boguski, Warren Gish, John C. Wootton, Issues in searching molecular sequence databases. Nature Genetics. ,vol. 6, pp. 119- 129 ,(1994) , 10.1038/NG0294-119
Patrick A. V. Hall, Geoff R. Dowling, Approximate String Matching ACM Computing Surveys. ,vol. 12, pp. 381- 402 ,(1980) , 10.1145/356827.356830
Jocelyn Sietsma, Robert J.F. Dow, Creating artificial neural networks that generalize Neural Networks. ,vol. 4, pp. 67- 79 ,(1991) , 10.1016/0893-6080(91)90033-2
Arun K. Pujari, Ashok K. Mittal, S.K. Gupta, A convex polytope of diameter one Discrete Applied Mathematics. ,vol. 5, pp. 241- 242 ,(1983) , 10.1016/0166-218X(83)90044-6
L F Abbott, T B Kepler, Universality in the space of interactions for network models Journal of Physics A. ,vol. 22, pp. 2031- 2038 ,(1989) , 10.1088/0305-4470/22/12/008
B M Forrest, Content-addressability and learning in neural networks Journal of Physics A. ,vol. 21, pp. 245- 255 ,(1988) , 10.1088/0305-4470/21/1/029