DeepAI AI Chat
Log In Sign Up

A Network Classification Method based on Density Time Evolution Patterns Extracted from Network Automata

by   Kallil M. C. Zielinski, et al.

Network modeling has proven to be an efficient tool for many interdisciplinary areas, including social, biological, transport, and many other real world complex systems. In addition, cellular automata (CA) are a formalism that has been studied in the last decades as a model for exploring patterns in the dynamic spatio-temporal behavior of these systems based on local rules. Some studies explore the use of cellular automata to analyze the dynamic behavior of networks, denominating them as network automata (NA). Recently, NA proved to be efficient for network classification, since it uses a time-evolution pattern (TEP) for the feature extraction. However, the TEPs explored by previous studies are composed of binary values, which does not represent detailed information on the network analyzed. Therefore, in this paper, we propose alternate sources of information to use as descriptor for the classification task, which we denominate as density time-evolution pattern (D-TEP) and state density time-evolution pattern (SD-TEP). We explore the density of alive neighbors of each node, which is a continuous value, and compute feature vectors based on histograms of the TEPs. Our results show a significant improvement compared to previous studies at five synthetic network databases and also seven real world databases. Our proposed method demonstrates not only a good approach for pattern recognition in networks, but also shows great potential for other kinds of data, such as images.


page 14

page 24


On the classifiability of cellular automata

Based on computer simulations Wolfram presented in several papers conjec...

Bayesian Ensemble Echo State Networks for Enhancing Binary Stochastic Cellular Automata

Binary spatio-temporal data are common in many application areas. Such d...

The Search for Computational Intelligence

We define and explore in simulation several rules for the local evolutio...

On the Cell-based Complexity of Recognition of Bounded Configurations by Finite Dynamic Cellular Automata

This paper studies complexity of recognition of classes of bounded confi...

Reservoir Computing Hardware with Cellular Automata

Elementary cellular automata (ECA) is a widely studied one-dimensional p...

Schema Redescription in Cellular Automata: Revisiting Emergence in Complex Systems

We present a method to eliminate redundancy in the transition tables of ...

From spatio-temporal data to chronological networks: An application to wildfire analysis

Network theory has established itself as an important tool for complex s...