Abstract
Information with structure is traditionally organized into records with fields. For example, a medical record consisting of name, sex, age, and weight might look like (Joe, male, 66, 77). What 77 stands for is determined by its location in the record, so that this is an example of local representation. The brain's wiring, and robustness under local damage, speak for the importance of distributed representations. The Holographic Reduced Representation (HRR) of Plate is a prime example based on real or complex vectors. This paper describes how spatter coding leads to binary HRRs, and how the fields of a record are encoded into a long binary word without fields and how they are extracted from such a word.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hinton, G.E. (1990) Mapping part-whole hierarchies into connectionist networks. Artificial Intelligence 46(1–2):47–75.
Kanerva, P. (1988) Sparse Distributed Memory. Cambridge, Mass.: MIT Press.
Kanerva, P. (1994) The Spatter Code for encoding concepts at many levels. In M. Marinaro and P.G. Morasso (eds.), ICANN '94, Proceedings International Conference on Artificial Neural Networks (Sorrento, Italy), vol. 1; 226–229. London: Springer-Verlag.
Kanerva, P. (1995) A family of binary spatter codes. In F. Fogelman-Soulie and P. Gallineri (eds.), ICANN '95, Proceedings International Conference on Artificial Neural Networks (Paris, France), vol. 1; 517–522. Paris: EC2 & Cie.
Miller, G. A. (1956) The magical number seven, plus or minus two: Some limits on our capacity for processing information. Psychological Review 63(2):81–97.
Murdock, B.B. (1982) A theory for the storage and retrieval of item and associative information. Psychological Review 89(6):316–338.
Plate, T. A. (1994) Distributed representations and nested compositional structure. PhD thesis. Graduate Department of Computer Science, University of Toronto. (Available on the Internet at Ftp-host: ftp.cs.utoronto.ca as Ftp-file: /pub/tap/plate.thesis.ps.Z)
Pollack, J.P. (1990) Recursive distributed representations. Artificial Intelligence 46(1–2): 77–105.
Rumelhart, D.E, and McClelland, J.L. (1986) On learning the past tenses of English verbs. In J.L. McClelland and D.E. Rumelhart (eds.), Parallel Distributed Processing 2: Applications; 216–271. Cambridge, Mass.: MIT Press.
Smolensky, P. (1990) Tensor product variable binding and the representation of symbolic structures in connectionist systems. Artificial Intelligence 46(1–2): 159–216.
Touretzky, D.S. (1990) BoltzCONS: Dynamic symbolic structures in connectionist networks. Artificial Intelligence 46(1–2):5–46.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kanerva, P. (1996). Binary spatter-coding of ordered K-tuples. In: von der Malsburg, C., von Seelen, W., Vorbrüggen, J.C., Sendhoff, B. (eds) Artificial Neural Networks — ICANN 96. ICANN 1996. Lecture Notes in Computer Science, vol 1112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61510-5_146
Download citation
DOI: https://doi.org/10.1007/3-540-61510-5_146
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61510-1
Online ISBN: 978-3-540-68684-2
eBook Packages: Springer Book Archive