Neighborhood Selection and Rules Identification for Cellular Automata: A Rough Sets Approach

09/22/2014
by   Bartlomiej Placzek, et al.
0

In this paper a method is proposed which uses data mining techniques based on rough sets theory to select neighborhood and determine update rule for cellular automata (CA). According to the proposed approach, neighborhood is detected by reducts calculations and a rule-learning algorithm is applied to induce a set of decision rules that define the evolution of CA. Experiments were performed with use of synthetic as well as real-world data sets. The results show that the introduced method allows identification of both deterministic and probabilistic CA-based models of real-world phenomena.

READ FULL TEXT
research
09/17/2015

Class Association Rules Mining based Rough Set Method

This paper investigates the mining of class association rules with rough...
research
08/11/2020

Image segmentation via Cellular Automata

In this paper, we propose a new approach for building cellular automata ...
research
03/27/2021

Generalization over different cellular automata rules learned by a deep feed-forward neural network

To test generalization ability of a class of deep neural networks, we ra...
research
01/10/2022

GBRS: An Unified Model of Pawlak Rough Set and Neighborhood Rough Set

Pawlak rough set and neighborhood rough set are the two most common roug...
research
10/31/2010

Prunnig Algorithm of Generation a Minimal Set of Rule Reducts Based on Rough Set Theory

In this paper it is considered rule reduct generation problem, based on ...
research
04/15/2008

Theory and Applications of Two-dimensional, Null-boundary, Nine-Neighborhood, Cellular Automata Linear rules

This paper deals with the theory and application of 2-Dimensional, nine-...
research
04/14/2023

Where is the Edge of Chaos?

Previous study of cellular automata and random Boolean networks has show...

Please sign up or login with your details

Forgot password? Click here to reset