The Capacity of Sparsely Encoded Associative Memories
スポンサーリンク
概要
- 論文の詳細を見る
We consider an asymptotically sparsely encoded associative memory. Patterns are encoded by n-dimensional vectors of -1 and +1 generated randomly by a sequence of biased Bernoulli trials and stored in the network according to Hebbian rule. Using a heuristic argument we derive the following
- 一般社団法人電子情報通信学会の論文
- 1993-03-25