A Binding Procedure for Distributed Binary Data Representations

Authors:
D. A. Rachkovskii;S. V. Slipchenko;E. M. Kussul';T. N. Baidyk
Affiliations:
International Scientific-Educational Center of Information Technologies and Systems, Kiev, Ukraine;International Scientific-Educational Center of Information Technologies and Systems, Kiev, Ukraine;National Autonomous University of Mexico, Mexico City, Mexico;National Autonomous University of Mexico, Mexico City, Mexico
Venue:
Cybernetics and Systems Analysis
Year:
2005

Citing 10
Cited 1

Mapping part-whole hierarchies into connectionist networks

Artificial Intelligence - On connectionist symbol processing
Distributed representations

Parallel distributed processing: explorations in the microstructure of cognition, vol. 1
Localized versus distributed representations

The handbook of brain theory and neural networks
Connectionist inference models

Neural Networks
Representation and Processing of Structures with Binary Sparse Distributed Codes

IEEE Transactions on Knowledge and Data Engineering
Binary Spatter-Coding of Ordered K-Tuples

ICANN 96 Proceedings of the 1996 International Conference on Artificial Neural Networks
Holographic Reduced Representation: Distributed Representation for Cognitive Structures

Holographic Reduced Representation: Distributed Representation for Cognitive Structures
Classical and Quantum Computation

Classical and Quantum Computation
Natural Thinking Mechanisms and Computer Intelligence

Cybernetics and Systems Analysis
Binding and Normalization of Binary Sparse Distributed Representations by Context-Dependent Thinning

Neural Computation

Vector representations for efficient comparison and search for similar strings

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Problems (inherent in compound hierarchical representations) of preserving information on the structure of coded data and methods of solving them by "binding" of information substructures are discussed. A type of distributed representations is considered in which data are coded by multidimensional binary sparse vectors. The constraints imposed on a binding procedure are formulated and its implementation is provided. Some examples of representation of structured data are considered.