By Topic

A New Adaptive Fast Cellular Automaton Neighborhood Detection and Rule Identification Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhao, Y. ; Dept. of Autom. Control & Syst. Eng., Univ. of Sheffield, Sheffield, UK ; Wei, H.L. ; Billings, S.A.

An important step in the identification of cellular automata (CA) is to detect the correct neighborhood before parameter estimation. Many authors have suggested procedures based on the removal of redundant neighbors from a very large initial neighborhood one by one to find the real model, but this often induces ill conditioning and overfitting. This is true particularly for a large initial neighborhood where there are few significant terms, and this will be demonstrated by an example in this paper. By introducing a new criteria and three new techniques, this paper proposes a new adaptive fast CA orthogonal-least-square (Adaptive-FCA-OLS) algorithm, which cannot only adaptively search for the correct neighborhood without any preset tolerance but can also considerably reduce the computational complexity and memory usage. Several numerical examples demonstrate that the Adaptive-FCA-OLS algorithm has better robustness to noise and to the size of the initial neighborhood than other recently developed neighborhood detection methods in the identification of binary CA.

Published in:

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on  (Volume:42 ,  Issue: 4 )