Binding and normalization of binary sparse distributed representations by context-dependent thinning
From MaRDI portal
Recommendations
- A binding procedure for distributed binary data representations
- scientific article; zbMATH DE number 67438
- Distributed representations based on geometric algebra: the continuous model
- Tensor product variable binding and the representation of symbolic structures in connectionist systems
- Sparse distributed memory using \(N\)-of-\(M\) codes
Cites work
Cited in
(15)- The Problem of Rapid Variable Creation
- Vector-derived transformation binding: an improved binding operation for deep symbol-like processing in neural networks
- Increasing the semantic storage density of sparse distributed memory
- Memory Capacities for Synaptic and Structural Plasticity
- Correcting the Normalization Shift of Redundant Binary Representations
- Time of searching for similar binary vectors in associative memory
- A binding procedure for distributed binary data representations
- Resonator networks. I: An efficient solution for factoring high-dimensional, distributed representations of data structures
- A theory of sequence indexing and working memory in recurrent neural networks
- Randomized projective methods for the construction of binary sparse vector representations
- Representation and Extrapolation in Multilayer Perceptrons
- Representing objects, relations, and sequences
- Some approaches to analogical mapping with structure-sensitive distributed representations
- scientific article; zbMATH DE number 67438 (Why is no real title available?)
- Images, Frames, and Connectionist Hierarchies
This page was built for publication: Binding and normalization of binary sparse distributed representations by context-dependent thinning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708447)