Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by de A. Barreto, G.
Right arrow Articles by Kremer, S. C.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by de A. Barreto, G.
Right arrow Articles by Kremer, S. C.
(Neural Computation. 2003;15:1255-1320.)
© 2003 The MIT Press


Review

A Taxonomy for Spatiotemporal Connectionist Networks Revisited: The Unsupervised Case

Guilherme de A. Barreto

gbarreto{at}sel.eesc.sc.usp.br, Department of Electrical Engineering, University of São Paulo, São Carlos, SP, Brazil

Aluizio F. R. Araújo

aluizioa{at}sel.eesc.sc.usp.br, Department of Electrical Engineering, University of São Paulo, São Carlos, SP, Brazil

Stefan C. Kremer

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:


Home page
Neural Comput.Home page
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]


Home page
Neural Comput.Home page
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]


Home page
Neural Comput.Home page
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
Copyright © 2003 by The MIT Press.