Abstract
A device algorithm which permanently records an expanding portfolio of similar conditions is described, along with an architecture in which this algorithm is used to avoid interference between prior and later learning.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
French, R.M.: Catastrophic Forgetting in Connectionist Networks. Trends in Cognitive Science 3, 128–135 (1999)
Robins, A.: Catastrophic Forgetting, rehearsal, and pseudorehearsal. Connection Science 7, 123–146 (1995)
Coward, L.A.: The Recommendation Architecture: lessons from the design of large scale electronic systems for cognitive science. Journal of Cognitive Systems Research 2, 111–156 (2001)
Coward, L.A., Gedeon, T.D., Kenworthy, W.: Application of the Recommendation Architecture to Telecommunications Network Management. Int. Journal of Neural Systems 11, 323–327 (2001)
Ratnayake, U., Gedeon, T.D.: Application of the Recommendation Architecture for Discovering Associative Similarities in Documents. In: Proceedings of the 9th International Conference on Neural Information Processing (2002)
Gokcay, E., Principe, J.C.: Information Theoretic Clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence 24, 158–169 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coward, L.A., Gedeon, T.D., Ratnayake, U. (2004). Managing Interference Between Prior and Later Learning. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds) Neural Information Processing. ICONIP 2004. Lecture Notes in Computer Science, vol 3316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30499-9_70
Download citation
DOI: https://doi.org/10.1007/978-3-540-30499-9_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23931-4
Online ISBN: 978-3-540-30499-9
eBook Packages: Springer Book Archive