Representation and processing of structures with binary sparse distributed codes

Rachkovskij, Dmitri A. (1999) Representation and processing of structures with binary sparse distributed codes. [Preprint] (Unpublished)

Full text available as:

[img] Postscript


The schemes for compositional distributed representations include those allowing on-the-fly construction of fixed dimensionality codevectors to encode structures of various complexity. Similarity of such codevectors takes into account both structural and semantic similarity of represented structures. In this paper we provide a comparative description of sparse binary distributed representation developed in the frames of the Associative-Projective Neural Network architecture and more well-known Holographic Reduced Representations of Plate and Binary Spatter Codes of Kanerva. The key procedure in Associative-Projective Neural Networks is Context-Dependent Thinning which binds codevectors and maintains their sparseness. The codevectors are stored in structured memory array which can be realized as distributed auto-associative memory. Examples of distributed representation of structured data are given. Fast estimation of similarity of analogical episodes by the overlap of their codevectors is used in modeling of analogical reasoning for retrieval of analogs from memory and for analogical mapping.

Item Type:Preprint
Keywords:Sparse coding, binary coding, binding, representation of structure, hierarchical representation, nested representation, long-term memory, analogy, compositional distributed representations, connectionist symbol processing, analogical retrieval, analogical mapping.
Subjects:Psychology > Cognitive Psychology
Computer Science > Artificial Intelligence
Computer Science > Neural Nets
ID Code:546
Deposited By: Rachkovskij, Dmitri
Deposited On:01 Jul 1999
Last Modified:11 Mar 2011 08:54


Repository Staff Only: item control page