Extracting Boolean rules from CA patterns

Yang, Y.X. and Billings, S.A. (2000) Extracting Boolean rules from CA patterns. IEEE Transactions on Systems Management and Cybernetics Part B: Cybernetics, 30 (4). pp. 573-581. ISSN 1083-4419

Full text available as:

Preview

Text billingssa7.pdf Download (546Kb)

Abstract

A multiobjective genetic algorithm (GA) is introduced to identify both the neighborhood and the rule set in the form of a parsimonious Boolean expression for both one- and two-dimensional cellular automata (CA). Simulation results illustrate that the new algorithm performs well even when the patterns are corrupted by static and dynamic noise

Item Type:	Article
Copyright, Publisher and Additional Information:	Copyright © 2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords:	Boolean identification, cellular automata, genetic algorithms, spatio-temporal systems
Academic Units:	The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Automatic Control and Systems Engineering (Sheffield)
Depositing User:	Sherpa Assistant
Date Deposited:	02 Dec 2005
Last Modified:	08 Feb 2013 16:48
Published Version:	http://dx.doi.org/10.1109/3477.865174
Status:	Published
Refereed:	Yes
Identification Number:	10.1109/3477.865174
URI:	http://eprints.whiterose.ac.uk/id/eprint/796

Actions (login required)

View Item