A Field To Dynamical Recurrent
Kolen
- 出版商: Wiley
- 出版日期: 2001-01-15
- 售價: $8,080
- 貴賓價: 9.5 折 $7,676
- 語言: 英文
- 頁數: 464
- 裝訂: Hardcover
- ISBN: 0780353692
- ISBN-13: 9780780353695
海外代購書籍(需單獨結帳)
相關主題
商品描述
Description:
Electrical Engineering A Field Guide to Dynamical Recurrent Networks Acquire the tools for understanding new architectures and algorithms of dynamical recurrent networks (DRNs) from this valuable field guide, which documents recent forays into artificial intelligence, control theory, and connectionism. This unbiased introduction to DRNs and their application to time-series problems (such as classification and prediction) provides a comprehensive overview of the recent explosion of leading research in this prolific field. A Field Guide to Dynamical Recurrent Networks emphasizes the issues driving the development of this class of network structures. It provides a solid foundation in DRN systems theory and practice using consistent notation and terminology. Theoretical presentations are supplemented with applications ranging from cognitive modeling to financial forecasting. A Field Guide to Dynamical Recurrent Networks will enable engineers, research scientists, academics, and graduate students to apply DRNs to various real-world problems and learn about different areas of active research. It provides both state-of-the-art information and a road map to the future of cutting-edge dynamical recurrent networks.
Table of Contents:
Preface.
Acknowledgments.
List of Figures.
List of Tables.
List of Contributors.
INTRODUCTION.
Dynamical Recurrent Networks (J. Kolen and S. Kremer).
ARCHITECTURES.
Networks with Adaptive State Transitions (D. Calvert and S. Kremer).
Delay Networks: Buffers to Rescue (T. Lin and C. Giles).
Memory Kernels (A. Tsoi, et al.).
CAPABILITIES.
Dynamical Systems and Iterated Function Systems (J. Kolen).
Representation of Discrete States (C. Giles and C. Omlin).
Simple Stable Encodings of Finite-State Machines in Dynamic Recurrent Networks (M. Forcada and R. Carrasco).
Representation Beyond Finite States: Alternatives to Pushdown Automata (J. Wiles, et al.).
Universal Computation and Super-Turing Capabilities (H. Siegelmann).
ALGORITHMS.
Insertion of Prior Knowledge (P. Frasconi, et al.).
Gradient Calculations for Dynamic Recurrent Neural Networks (B. Pearlmutter).
Understanding and Explaining DRN Behavior (C. Omlin).
LIMITATIONS.
Evaluating Benchmark Problems by Random Guessing (J. Schmidhuber, et al.).
Gradient Flow in Recurrent Nets: The Difficulty of Learning Long-Term Dependencies (S. Hochreiter, et al..
Limiting the Computational Power of Recurrent Neural Networks: VC Dimension and Noise (C. Moore).
APPLICATIONS.
Dynamical Reccurent Networks in Control (D. Prokhorov, et al.).
Sentence Processing and Linguistic Structure (W. Tabor).
Neural Network Architectures for the Modeling of Dynamic Systems (H. Zimmerman and R. Neuneier).
From Sequences to Data Structures: Theory and Applications (P. Frasconi, et al.).
CONCLUSION.
Dynamical Recurrent Networks: Looking Back and Looking Forward (S. Kremer and J. Kolen).
Bibliography.
Glossary.
Index.
About the Editors.
