Mining frequent patterns in 2D+t grid graphs for cellular automata analysis

DOI10.1007/978-3-319-58961-9_16MaRDI QIDQ5082154zbMATH OpenOpenAlexFDO

Authors Romain Deville, Élisa Fromont, Baptiste Jeudy, Christine Solnon

Publication date 15 June 2022

Published in Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-58961-9_16

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 1930117
• Complete mining of frequent patterns from graphs: Mining graph data
• Mining graph patterns
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
• scientific article; zbMATH DE number 1832338

Cites work

• Anytime discovery of a diverse set of patterns with Monte Carlo tree search

This page was built for publication: Mining frequent patterns in 2D+t grid graphs for cellular automata analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082154)