PERFORMANCE-CHARACTERISTICS OF THE ASSOCIATIVE NET

被引:28
作者
BUCKINGHAM, J [1 ]
WILLSHAW, D [1 ]
机构
[1] UNIV EDINBURGH,CTR COGNIT SCI,EDINBURGH EH8 9LW,SCOTLAND
关键词
D O I
10.1088/0954-898X/3/4/005
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The associative net is a fully connected feedforward associative memory with one layer of input units, one layer of output units and binary valued weights. Its simple structure and the form of the weight modification rule used have led to several analyses of two measures of its performance: capacity and information efficiency. However, these have yielded only approximate expressions. In this paper we present a more precise treatment. Simulation results are presented to support the analysis and to deal with the cases where analysis is not possible. We extend previous work which showed that in some cases it may be more efficient (in information theoretic terms) to store many patterns that are each retrieved with a high error rate rather than fewer patterns which are each retrieved with high accuracy.
引用
收藏
页码:407 / 414
页数:8
相关论文
共 6 条
[1]  
[Anonymous], 1963, MATH THEORY COMMUNIC
[2]  
Buckingham J., 1991, THESIS U EDINBURGH
[3]  
HEBB DO, 1949, ORG BEHAVIOR
[4]   Information storage in sparsely coded memory nets [J].
Nadal, Jean-Pierre ;
Toulouse, Gerard .
NETWORK-COMPUTATION IN NEURAL SYSTEMS, 1990, 1 (01) :61-74
[5]  
Willshaw D. J., 1971, THESIS U EDINBURGH
[6]   NON-HOLOGRAPHIC ASSOCIATIVE MEMORY [J].
WILLSHAW, DJ ;
BUNEMAN, OP ;
LONGUETH.HC .
NATURE, 1969, 222 (5197) :960-&