|
|
||||||||
Review |
gbarreto{at}sel.eesc.sc.usp.br, Department of Electrical Engineering, University of São Paulo, São Carlos, SP, Brazil
aluizioa{at}sel.eesc.sc.usp.br, Department of Electrical Engineering, University of São Paulo, São Carlos, SP, Brazil
skremer{at}uoguelph.ca, Guelph Natural Computation Group, Department of Computing and Information Science, University of Guelph, Guelph, Ontario N1G 2W1, Canada
Spatiotemporal connectionist networks (STCNs) comprise an important class of neural models that can deal with patterns distributed in both time and space. In this article, we widen the application domain of the taxonomy for supervised STCNs recently proposed by Kremer (2001) to the unsupervised case. This is possible through a reinterpretation of the state vector as a vector of latent (hidden) variables, as proposed by Meinicke (2000). The goal of this generalized taxonomy is then to provide a nonlinear generative framework for describing unsupervised spatiotemporal networks, making it easier to compare and contrast their representational and operational characteristics. Computational properties, representational issues, and learning are also discussed, and a number of references to the relevant source publications are provided. It is argued that the proposed approach is simple and more powerful than the previous attempts from a descriptive and predictive viewpoint. We also discuss the relation of this taxonomy with automata theory and state-space modeling and suggest directions for further work.
This article has been cited by other articles:
![]() |
P. Tino, I. Farkas, and J. v. Mourik Dynamics and Topographic Organization of Recursive Self-Organizing Maps. Neural Comput., October 1, 2006; 18(10): 2529 - 2567. [Abstract] [Full Text] [PDF] |
||||
![]() |
H. Jacobsson Rule Extraction from Recurrent Neural Networks: A Taxonomy and Review Neural Comput., June 1, 2005; 17(6): 1223 - 1263. [Abstract] [Full Text] [PDF] |
||||
![]() |
R. Schulz and J. A. Reggia Temporally Asymmetric Learning Supports Sequence Processing in Multi-Winner Self-Organizing Maps Neural Comput., March 1, 2004; 16(3): 535 - 561. [Abstract] [Full Text] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
| J COGNITIVE NEUROSCIENCE | NEURAL COMPUTATION | MIT PRESS JOURNALS |