Evolving Recurrent Perceptrons for Time-Series Modeling

IEEE Transactions on Neural Networks

Volumn 5, Issue 1, 1994, Pages 24-38

  McDonnell, J R ^a   Waagen, D ^b  

^a Naval Command   (United States)

^b NORTHROP GRUMMAN CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; DIGITAL FILTERS; INFORMATION THEORY; LEARNING SYSTEMS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; ONLINE SEARCHING; OPTIMIZATION; RANDOM PROCESSES; STOCHASTIC CONTROL SYSTEMS; TIME SERIES ANALYSIS;

EVOLUTIONARY PROGRAMMING PARADIGM; FILTER STRUCTURE; HYBRID STOCHASTIC OPTIMIZATION APPROACH; RECURRENT PERCEPTRON; STOCHASTIC SEARCH TECHNIQUE; STOCHASTIC TRAINING METHOD;

NEURAL NETWORKS;

EID: 0028312789     PISSN: 10459227     EISSN: 19410093     Source Type: Journal    
DOI: 10.1109/72.265958     Document Type: Article

References (39)

1. E. Aarts and J. Korst, Simulated Annealing and Boltzman Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. New York: John Wiley & Sons, 1989.
2. J. H. Holland, Adaptation in Natural and Artificial Systems. 2nd edition, Cambridge, MA: MIT Press, 1992.
3. L. J. Fogel, A. J. Owens, and M. J. Walsh, Artificial Intelligence Through Simulated Evolution. John Wiley & Sons, 1966.
4. D. B. Fogel, “An Evolutionary approach to the traveling salesman problem,” Biological Cybernetics, vol. 60, No. 2, 1988.
5. D. B. Fogel, System Identification though Simulated Evolution: A Machine Learning Approach to Modeling. Needham, MA: Ginn Press, 1991.
6. D. B. Fogel, L. J. Fogel, and V. W. Porto, “Evolving neural networks,” Biological Cybernetics, vol. 62, pp. 487–493, 1990.
7. R. J. Williams, “Adaptive State Representation and Estimation using Recurrent Connectionist Networks,” in Neural Networks for Control, W. T. Moller, R. S. Sutton, and P. J. Werbos, Eds. Cambridge, MA: MIT Press, 1990.
8. A. Waibel, T. Hanazawa, G. Hinton, K. Shikano and K. J. Lang, “Phoneme recognition using time-delay neural networks,” IEEE Trans. on Acoustics, Speech, and Signal Processing, vol. 37, No. 8, 1989.
9. R. D. Jones, Y. C. Lee, S. Qian, C. W. Barnes, K. R. Bisset, G. M. Bruce, G. W. Flake, K. Lee, L. A. Lee, W. C. Mead, M. K. O’Rouke, I. J. Poli and L. E. Thode, “Nonlinear adaptive networks: a little theory, a few applications,” Technical Report LA-UR 91–273, Los Alamos National Los 1991.
10. W. C. Mead, R. D. Jones, Y. C. Lee, C. W. Barnes, G. W. Glake, L. A. Lee and M. K. O’Rourke, “Prediction of chaotic time series using CNLS-NET—example: The Mackey-Glass equation,” Technical Report LA-UR-91-720, Los Alamos National Laboratory, Los Alamos, NM, 1991.
11. R. D. Jones, Y. C. Lee, C. W. Barnes, G. W. Flake, K. Lee, P. S. Lewis and S. Qian, “Function approximation and time series prediction with neural networks,” Technical Report LA-UR 90–21, Los Alamos National Laboratory, Los Alamos, NM, 1990.
12. A. S. Weigned, D. E. Rumelhart, and B. A. Huberman, “Predicting the future: A connectionist approach,” Technical Report Stanford-PDP-9001 or PARC-SSL-90-20, 1990.
13. C. Svarer, L. K. Hansen, and J. Larsen, “On design and evaluation of tapped-delay neural network architectures,” IEEE Int. Conf. on Neural Networks, San Francisco, 1992.
14. S. J. Nowlan and G. E. Hinton, “Simplifying neural networks by soft weight sharing,” Neural Computation, vol. 4, No. 4, 1992.
15. S. S. Rao and V. Ramamurti, “A hybrid technique to enhance the performance of recurrent neural networks for time series prediction,” IEEE Int. Conf. on Neural Networks, San Francisco, 1993.
16. S. E. Fahlman and C. Lebiere, “The cascade-correlation learning architecture,” Technical Report CMU-CS-90-100, Camegie-Mellon University, Pitttsburgh, PA, 1990.
17. N. Saravanan, “Evolving neural networks: applications to a prediction problem,” Second Annual Conf. on Evolutionary Programming, La Jolla, CA, 1993, pp. 72–78.
18. J. R. McDonnell and D. Waagen, “Neural network structure design by evolutionary programming,” Second Annual Conf. on Evolutionary Programming, La Jolla, CA, 1993, 79–89.
19. P. Angeline, G. M. Saunders, and J. B. Pollack, “An evolutionary algorithm that constructs recurrent neural networks,” IEEE Trans. on Neural Networks, 1994, this issue.
20. D. B. Fogel, “Using evolutionary programming for modeling: an ocean acoustic example,” IEEE Journal on Oceanic Eng., vol. 17, No. 4, pp. 333–340, 1992.
21. A. Gelb, Applied Optimal Estimation. Cambridge, MA: MIT Press, 1974.
22. L. Li and S. Haykin, “A cascaded recurrent neural network for real-time nonlinear adaptive filtering,” IEEE Int. Conf. on Neural Networks, San Francisco, 1993.
23. X. Yao, “A review of evolutionary artificial neural networks,” Int. Journal of Intelligent Systems, to appear.
24. D. Waagen, P. Diercks, and J. R. McDonnell, “The stochastic direction set algorithm: A hybrid technique for finding function extrema,” First Annual Conf. on Evolutionary Programming, La Jolla, CA, 1992, pp. 35–42.
25. S. S. Rao, Optimization Theory and Applications. New York: John Wiley and Sons, 1978.
26. D. C. Karnopp, “Random search techniques for optimization problems,” Automatica, vol. 1, pp. 111–121, 1963.
27. D. A. Pierre, Optimization Theory with Applications. Dover, 1986.
28. Z. Michalwicz, Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, 1992.
29. J. Matyas, “Random optimization,” Automation and Remote Control, vol. 26, pp. 244–251, 1965.
30. F. J. Solis and J. B. Wets, “Minimization by random search techniques,” Mathematics of Operations Research, vol. 6, no. 1, pp. 19–50, 1981.
31. N. Baba, “A new approach for finding the global minimum of error function of neural networks,” Neural vol. 2, pp. 19–30, 1989.
32. I. O. Bohachevsky, M. E. Johnson, and M. L. Stein, “Generalized simulated anealing for function optimization,” Technometrics, vol. 28, no. 3, pp. 209–218, 1986.
33. T. Back, G. Rudolph, and H.P. Schwefel, “Evolutionary programming evolution strategies: similarities and differences,” Second Annual Conf. on Evolutionary Programming, San Diego, 1993.
34. D. B. Fogel, “Evolving Artificial Intelligence,” Ph.D. Dissertation, University of California, San Diego, 1992.
35. S. H. Brooks, “A discussion of random methods for seeking maxima,” Operations Research, vol. 6, pp. 244–251, 1958.
36. G. B. Fogel and D. B. Fogel, “Continuous evolutionary programming: Analysis and experiments,” Cybernetics and Systems, in review.
37. P. P. C. Yip and Y. H. Pao, “A fast universal training algorithm for neural networks,” World Congress on Neural Networks, Portland, OR, 1993.
38. H. H. Rosenbrock, “An automatic method for finding the greatest of least value of a function,” The Computer Journal, vol. 3, p. 175, 1960.
39. K. S. Narendra and K. Parthasarathy, “Identification and control of dynamical systems using neural networks,” IEEE Trans, on Neural Networks, vol. 1, no. 1, 1990.