A Binding Procedure for Distributed Binary Data Representations

作者: D. A. Rachkovskii , S. V. Slipchenko , E. M. Kussul' , T. N. Baidyk

DOI: 10.1007/S10559-005-0066-Z

关键词:

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

参考文章(19)
C. Von Der Malsburg, Am I Thinking Assemblies Springer, Berlin, Heidelberg. pp. 161- 176 ,(1986) , 10.1007/978-3-642-70911-1_10
Nikolai Amosov, Modeling of thinking and the mind ,(1967)
Pentti Kanerva, Binary Spatter-Coding of Ordered K-Tuples international conference on artificial neural networks. pp. 869- 873 ,(1996) , 10.1007/3-540-61510-5_146
Simon Thorpe, Localized versus distributed representations The handbook of brain theory and neural networks. pp. 549- 552 ,(1998)
Alexander Frolov, Dmitri Rachkovskij, Dusan Husek, On information characteristics of sparsely encoded binary auto-associative memory international conference on neural information processing. ,vol. 1, pp. 235- 238 ,(2002) , 10.1109/ICONIP.2002.1202168
David E. Rumelhart, James L. McClelland, , Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations Computational Models of Cognition and Perception. ,(1986) , 10.7551/MITPRESS/5236.001.0001
E. Kussul, T. Baidyk, Permutative coding technique for handwritten digit recognition system international joint conference on neural network. ,vol. 3, pp. 2163- 2168 ,(2003) , 10.1109/IJCNN.2003.1223743