Skip to Main content Skip to Navigation
Conference papers

Mining Frequent Patterns in 2D+t Grid Graphs for Cellular Automata Analysis

Abstract : A 2D grid is a particular geometric graph that may be used to represent any 2D regular structure such as, for example, pixel grids, game boards, or cellular automata. Pattern mining techniques may be used to automatically extract interesting substructures from these grids. 2D+t grids are temporal sequences of grids which model the evolution of grids through time. In this paper, we show how to extend a 2D grid mining algorithm to 2D+t grids, thus allowing us to efficiently find frequent patterns in 2D+t grids. We evaluate scale-up properties of this algorithm on 2D+t grids generated by a classical cellular automaton, i.e., the game of life, and we show that the extracted spatio-temporal patterns may be used to analyze this kind of cellular automata.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Romain Deville Connect in order to contact the contributor
Submitted on : Thursday, March 23, 2017 - 5:06:25 PM
Last modification on : Tuesday, June 1, 2021 - 2:08:07 PM
Long-term archiving on: : Saturday, June 24, 2017 - 3:57:27 PM


Files produced by the author(s)




Romain Deville, Elisa Fromont, Baptiste Jeudy, Christine Solnon. Mining Frequent Patterns in 2D+t Grid Graphs for Cellular Automata Analysis. Graph-Based Representations in Pattern Recognition: 11th IAPR-TC-15 International Workshop, GbRPR 2017, May 2017, Anacapri, Italy. pp.177--186, ⟨10.1007/978-3-319-58961-9⟩. ⟨hal-01494623⟩



Record views


Files downloads