No label defined (Q3814833)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4085057
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4085057

      Statements

      0 references
      0 references
      1988
      0 references
      associative memory model
      0 references
      disjunctive codes
      0 references
      neural network
      0 references
      information reproduction
      0 references
      A fragment model of associative memory of a neural network defined by \textit{G. Palm} [Biol. Cybern. 36, 19-31 (1980; Zbl 0426.68102)] is introduced. The task of the fragment is to store and reproduce a mapping of a set of t queries onto a set of t answers. Queries and answers are coded by boolean n-ary and m-ary vectors, respectively. A query code of length n for storage capacity t is given by a boolean matrix X of size \(n\times t\) with code vectors as columns; an answer code is given in an analogous way. An ordered pair (X,Y) of codes has the property of stored information reproduction if any mapping p: \(X\to Y\) based on a permutation of \(\{\) 1,2,...,t\(\}\) is representable by \(y_{p(u)}=A^ p x_ u\), \(u=1,2,...,t\), where \(A^ p\) is an associative memory matrix for the mapping p. A pair (X,Y) has the reproduction property iff X is a disjunctive (s,t)-code, where s is the maximum number of ``1'' in a row of Y. In the paper formulas giving interrelations of parameters m, n, t necessary for the reproduction property of codes are summarized.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references