A new fast cellular automata orthogonal least-squares identification method

International Journal of Systems Science

Volumn 36, Issue 8, 2005, Pages 491-499

  Billings, S A ^a,c,d   Mei, S S ^b  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

^c IEE ^*  (United Kingdom)

^d Institute of Mathematics and Its Applications   (United Kingdom)

Author keywords

Cellular automata; Identification; Orthogonal least squares; Polynomial

Indexed keywords

CELLULAR AUTOMATA; COMPUTATIONAL TIME;

COMPUTER SIMULATION; IDENTIFICATION (CONTROL SYSTEMS); POLYNOMIALS;

LEAST SQUARES APPROXIMATIONS;

EID: 27944434630     PISSN: 00207721     EISSN: 14645319     Source Type: Journal    
DOI: 10.1080/00207720500147784     Document Type: Article

References (23)

1. A. Adamatzky, "Automatic programming of cellular automata: identification approach", Kybernetes, 26, pp. 126-133, 1997.
2. C. Andersson, S. Rasmussen and R. White, "Urban settlement transitions", Environ. Plan. Plan. Design, 29, pp. 841-865, 2002.
3. D. Andre, F.H. Bennet, III and R.R. Koza, "Evolution of intricate long-distance dommunication signals in cellular automata using genetic programming", in Genetic Programming 1996, Proceedings of the 1st Annual Conference, Cambridge, MA: MIT Press, 1996.
4. S.A. Billings, S. Chen and M.J. Korenberg, "Identification of MIMO nonlinear system using a forward regression orthogonal estimator", Int. J. Control, 49, pp. 2157-2189, 1989.
5. S.A. Billings and Y. Yang, "Identification of the neighbourhood and CA Rules from Spatio-temporal CA patterns", IEEE Transactions on Systems Man and Cybernetics, Part B, 33, pp. 332-339, 2003a.
6. S.A. Billings and Y. Yang, "Identification of probabilistic cellular automata", IEEE Trans. Syst. Man Cybern. B, 33, pp. 225-236, 2003b.
7. P.P. Chaudhuri, D.R. Chowdhury, S. Nandi and S. Chattopadhyay, Additive Cellular Automata: Theory and Applications, Los Alamitos, California: IEEE Computer Society Press, 1997.
8. J.R. Koza, Genetic Programming ll: Automatic Discovery of Reusable Programs, Cambridge, MA: MIT Press, 1994.
9. W. Li and M.G. Nordahl, "Transient behaviour of cellular automataon rule 110", Phys. Lett. A, 166, pp. 335-339, 1992.
10. X.B. Li, R. Jiang and Q.S. Wu, "Cellular automata model simulating complex spatiotemporal structure of wide jams", Phys. Rev. E, 68, pp. 016117 (1-5), 2003.
11. G. Rabino and A. Laghi, "Identification of cellular automata: theoretical remarks", 2002. Available online at: http://econpapers.hhs.se/ paper/wiwwiwrsa/ersa02p460.htm (accessed March 2005).
12. J. von Neumann, "The general logical theory of automata", in Cerebral Mechanisms in Behaviour - The Hixon Symposium, New York: Wiley, 1951.
13. B. Voorhees, "Predecessor states for certain cellular automata evolutions", Commun. Math. Phys., 117, pp. 431-439, 1988.
14. B. Voorhees, "Multifractals defined by nonlinear cellular automata", Int. J. Bifurc. Chaos, 8, pp. 259-280, 1998.
15. S. Wolfram, "Statistical mechanics of cellular automata", Rev. Mod. Phys., 55, pp. 601-644, July, 1983.
16. S. Wolfram, "Universality and complexity in cellular automata", Physica D, 10(1), 1984.
17. S. Wolfram, Theory and Applications of Cellular Automata, Singapore: World Scientific, 1986.
18. S. Wolfram, A New Kind of Science, Champaign, IL: Wolfram Media, 2002.
19. A. Wuensche, "Discrete Dynamics Lab: Tools for investigating cellular automata and discrete dynamical networks", Kybernetes, 32, pp. 77-104, 2003.
20. Y. Yang and S.A. Billings, "Extracting Boolean rules from CA patterns", IEEE Trans. Syst. Man Cybern. B, 30, pp. 573-581, 2000a.
21. Y. Yang and S.A. Billings, "Neighbourhood detection and rule selection from cellular automata patterns", IEEE Trans. Syst. Man Cybern. A, 30, pp. 840-847, 2000b.
22. Q. Zhang, Using Wavelet Network in Nonparametric Estimation. Paris, France: IRISA, France, Publication Interne, 1994.
23. Q.M. Zhu and S.A. Billings, "Fast identification of nonlinear stochastic models and radial basis function neural networks", Int. J. Control, 64, pp. 871-886, 1996.