Abstract
A fundamental problem with layered neural networks is the loss of information about the relationships among features in the input space and relationships inferred by higher order classifiers. Information about these relationships is required to solve problems such as discrimination of simultaneously presented objects and discrimination of feature components. We propose a biologically motivated model for a classifier that preserves this information. When composed into classification networks, we show that the classifier propagates and aggregates information about feature relationships. We discuss how the model should be capable of segregating this information for the purpose of object discrimination and aggregating multiple feature components for the purpose of feature component discrimination.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bednar, J. A. & Miikkulainen, R. (2003) Neurocomputing, 52–54:473–480.
Choe, Y. & Mikkulainen, R. (2004) Biol Cybern., 90(2):75–88.
Gray C. M. & Singer W. (1989) Proc Natl Acad Sci USA 86: 1698–1702.
Grinvald, A. & Lieke, E. & Frostig, R. D. & Gilbert, C. D. & Weisel, T. N. (1986) Nature, 324(6095):361–4
Rosenblatt, F., (1962) Principles of Neurodynamics: Perception and the Theory of Brain Mechanisms. Washington: Spartan Books
Seth, A.K. & McKinstry, J.L. & Edelman, G.M. & Krichmar, J.L. (2004) Cerebral Cortex May 13 Advanced access.
Song S., & Abbott L. F. (2001) Neuron Oct 25;32(2):339–50.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag/Wien
About this paper
Cite this paper
Peck, C.C., Kozloski, J., Cecchi, G.A., Rao, A.R. (2005). A Biologically Motivated Classifier that Preserves Implicit Relationship Information in Layered Networks. In: Ribeiro, B., Albrecht, R.F., Dobnikar, A., Pearson, D.W., Steele, N.C. (eds) Adaptive and Natural Computing Algorithms. Springer, Vienna. https://doi.org/10.1007/3-211-27389-1_20
Download citation
DOI: https://doi.org/10.1007/3-211-27389-1_20
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-24934-5
Online ISBN: 978-3-211-27389-0
eBook Packages: Computer ScienceComputer Science (R0)