A Binding Procedure for Distributed Binary Data Representations

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 bin...

Full description

Saved in:
Bibliographic Details
Published inCybernetics and systems analysis Vol. 41; no. 3; pp. 319 - 331
Main Authors Rachkovskii, D A, Slipchenko, S V, Kussul', E M, Baidyk, T N
Format Journal Article
LanguageEnglish
Published New York Springer Nature B.V 01.05.2005
Subjects
Algorithms
Binary system
Codes
Coding standards
Data analysis
Mathematical models
Neural networks
Systems analysis
Online AccessGet full text

Cover

More Information
Summary: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. [PUBLICATION ABSTRACT]
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-005-0066-z