. .. , BoW-based representation of images, p.79

. .. , Pattern mining for image classification, p.80

.. .. Experimental, , vol.87

. .. , Overview of the classification process, p.89

.. .. Accuracy-results,

.. .. Discussion,

, Application of GriMA to Cellular Automata Analysis 97

. .. Automata, 2.2 Representation of Game of Life initial states by histograms of frequent patterns

, Overview of the learning process

. .. , Overview of the classification process, p.105

, 3.2 Counting the number of occurrences in grids, p.107

.. .. Accuracy-results,

.. .. Discussion, 101 7.2.2 Representation of Game of Life initial states by histograms of frequent patterns

. .. , Overview of the learning process, vol.104

, Overview of the classification process, p.105

, 3.2 Counting the number of occurrences in grids, p.107

.. .. Accuracy-results,

.. .. Discussion,

B. Acosta-mendoza, N. , A. G. Alonso, and J. E. Medina-pagola, Frequent approximate subgraphs as features for graph-based image classification, Knowl.-Based Syst, vol.27, p.45, 2012.

R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules in Large Databases, Proceedings of 20th International Conference on Very Large Data Bases, pp.487-499, 1994.

H. Arimura, T. Uno, S. Shimozono-;-v.-corruble, M. Takeda, and E. Suzuki, Time and Space Efficient Discovery of Maximal Geometric Graphs, Discovery Science, 10th International Conference, vol.4755, pp.42-55, 2007.

G. Audemard, C. Lecoutre, M. S. Modeliar, G. Goncalves, and D. C. Porumbel, Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem, Principles and Practice of Constraint Programming -20th International Conference, vol.8656, p.13, 2014.

L. Babai, Graph isomorphism in quasipolynomial time, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, p.12, 2016.

A. Bendimerad, M. Plantevit, and C. Robardet, Mining exceptional closed patterns in attributed graphs, p.27, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01625007

T. D. Bie, Maximum entropy models and subjective interestingness: an application to tiles in binary databases, Data Min. Knowl. Discov, vol.23, issue.3, p.28, 2011.

T. D. Bie, K. Kontonasios, and E. Spyropoulou, A framework for mining interesting pattern sets, SIGKDD Explorations, vol.12, issue.2, p.28, 2010.

C. Borgelt and M. R. Berthold, Mining Molecular Fragments: Finding Relevant Substructures of Molecules, Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002, vol.41, p.27, 2002.

G. Bosc, C. Raïssi, J. Boulicaut, and M. Kaytoue, Any-time Diverse Subgroup Discovery with Monte Carlo Tree Search, CoRR, abs/1609.08827, 2016.

B. Breckling, G. , and Y. G. Matsinos, Cellular Automata in Ecological Modelling, Modelling Complex Ecological Dynamics: An Introduction into Ecological Modelling for Students, Teachers & Scientists, 2011.

P. Briggs and L. Torczon, An Efficient Representation for Sparse Sets, LOPLAS, vol.2, issue.1-4, p.69, 1993.

B. Bringmann and S. Nijssen, What Is Frequent in a Single Graph, Advances in Knowledge Discovery and Data Mining, 12th Pacific-Asia Conference, p.26, 2008.

A. Buzmakov, S. O. Kuznetsov, and A. Napoli, Fast Generation of Best Interval Patterns for Nonmonotonic Constraints, Machine Learning and Knowledge Discovery in Databases -European Conference, ECML PKDD 2015, vol.9285, p.28, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01186718

L. Cerf, J. Besson, C. Robardet, and J. Boulicaut, Data-Peeler: Constraint-based Closed Pattern Mining in n-ary Relations, SIAM International Conference on Data Mining SDM'08. Atlanta, p.28, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01500635

C. Chang and C. Lin, LIBSVM: A library for support vector machines, ACM TIST, vol.2, issue.3, p.27, 2011.

K. Chatfield, V. S. Lempitsky, A. Vedaldi, and A. Zisserman, The devil is in the details: an evaluation of recent feature encoding methods, British Machine Vision Conference, p.79, 2011.

K. Chatfield, K. Simonyan, A. Vedaldi, and A. Zisserman, Return of the Devil in the Details: Delving Deep into Convolutional Nets, British Machine Vision Conference, p.79, 2014.

C. Chen, X. Yan, F. Zhu, and J. Han, gApprox: Mining Frequent Approximate Patterns from a Massive Network, Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), p.44, 2007.

H. Cheng, X. Yan, J. Han, and C. Hsu, Discriminative Frequent Pattern Analysis for Effective Classification, Proceedings of the 23rd International Conference on Data Engineering, pp.716-725, 2007.

R. Chirkova, A. Dogac, M. T. Özsu, and T. K. Sellis, The Marmara Hotel, Proceedings of the 23rd International Conference on Data Engineering, 2007.

J. Conway, The game of life, Scientific American, vol.223, issue.4, p.98, 1970.

D. Cook and L. Holder, Mining Graph Data, J. Wiley & Sons (cit. on pp, vol.1, 2006.

L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs, IEEE Trans. Pattern Anal. Mach. Intell, vol.26, issue.10, p.13, 2004.

L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, An improved algorithm for matching large graphs, In: 3rd IAPR-TC15 workshop on graphbased representations in pattern recognition, p.12, 2001.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, p.18, 2009.

. Insa-lyon, G. Csurka, C. Dance, L. Fan, J. Willamowski et al., Visual categorization with bags of keypoints, Workshop on statistical learning in computer vision, ECCV, vol.1, p.79, 2004.

M. Elseidy, E. Abdelhamid, S. Skiadopoulos, and P. Kalnis, GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph, PVLDB, vol.7, issue.7, p.43, 2014.

U. M. Fayyad and R. Uthurusamy, Knowledge Discovery in Databases: Papers from the 1994 AAAI Workshop, 1994.

U. M. Fayyad, G. Piatetsky-shapiro, and P. Smyth, From Data Mining to Knowledge Discovery: An Overview, Advances in Knowledge Discovery and Data Mining, p.24, 1996.

B. Fernando, É. Fromont, and T. Tuytelaars, Mining Mid-level Features for Image Classification, International Journal of Computer Vision, vol.108, issue.3, pp.28-30, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00968299

M. Flores-garrido, J. A. Carrasco-ochoa, and J. F. Trinidad, AGraP: an algorithm for mining frequent patterns in a single graph using inexact matching, Knowl. Inf. Syst, vol.44, issue.2, p.45, 2015.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, p.13, 1979.

L. Geng and H. J. Hamilton, Interestingness measures for data mining: A survey, ACM Comput. Surv, vol.38, issue.3, p.25, 2006.

S. Gosselin, G. Damiand, and C. Solnon, Frequent Submap Discovery, Combinatorial Pattern Matching -22nd Annual Symposium, vol.6661, p.42, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00636373

E. Gudes, S. E. Shimony, and N. Vanetik, Discovering Frequent Graph Patterns Using Disjoint Paths, IEEE Trans. Knowl. Data Eng, vol.18, issue.11, p.26, 2006.

C. Higuera, J. De-la, É. Janodet, G. Samuel, C. Damiand et al., Polynomial algorithms for open plane graph and subgraph isomorphisms, Theor. Comput. Sci, vol.498, pp.16-18, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00832098

P. Hogeweg, Cellular Automata As a Paradigm for Ecological Modeling, Appl. Math. Comput, vol.27, issue.1, p.5, 1988.

L. B. Holder, D. J. Cook, and S. Djoko, Substucture Discovery in the SUBDUE System, Knowledge Discovery in Databases: Papers from the 1994 AAAI Workshop, p.43, 1994.

T. Horváth, J. Ramon, and S. Wrobel, Frequent subgraph mining in outerplanar graphs, Data Min. Knowl. Discov, vol.21, issue.3, pp.472-508, 2010.

J. Huan, W. Wang, and J. Prins, Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism, Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), p.35, 2003.

J. Huan, W. Wang, J. Prins, and J. Yang, SPIN: mining maximal frequent subgraphs from graph databases, Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.581-586, 2004.

G. Huang, Z. Liu, L. Van-der-maaten, and K. Q. Weinberger, Densely Connected Convolutional Networks, 2017 IEEE Conference on Computer Vision and Pattern Recognition, pp.2261-2269, 2017.

A. Inokuchi, T. Washio, and H. Motoda, An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data, Principles of Data Mining and Knowledge Discovery, 4th European Conference, vol.1910, p.31, 2000.

Y. Jia, J. Zhang, and J. Huan, An efficient graph-mining method for complicated and noisy data with real-world applications, Knowl. Inf. Syst, vol.28, issue.2, pp.423-447, 2011.

C. Jiang, F. Coenen, and M. Zito, A survey of frequent subgraph mining algorithms, Knowledge Eng. Review, vol.28, issue.1, pp.75-105, 2013.

R. Kessl, N. Talukder, P. Anchuri, and M. J. Zaki, Parallel Graph Mining with GPUs, Proceedings of the 3rd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Cette thèse est accessible à l'adresse, vol.36, p.43, 2014.

W. Kim, R. Kohavi, J. Gehrke, and W. Dumouchel, Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004.

L. Kotthoff, C. Mccreesh, and C. Solnon, Portfolios of Subgraph Isomorphism Algorithms, Learning and Intelligent Optimization -10th International Conference, vol.10, p.13, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01301829

M. Kuramochi and G. Karypis, Frequent Subgraph Discovery, Proceedings of the 2001 IEEE International Conference on Data Mining, p.29, 2001.

N. Cercone, T. Y. Lin, and X. Wu, , pp.313-320, 2001.

, Discovering Frequent Geometric Subgraphs, Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002, p.14, 2002.

, Finding Frequent Patterns in a Large Sparse Graph, Proceedings of the Fourth SIAM International Conference on Data Mining, vol.43, p.42, 2004.

, Finding Frequent Patterns in a Large Sparse Graph, Data Min, 2005.

. Knowl and . Discov, , vol.11, p.42

, Discovering frequent geometric subgraphs, Inf. Syst, vol.32, issue.8, pp.1101-1120, 2007.

J. Larrosa and G. Valiente, Constraint Satisfaction Algorithms for Graph Pattern Matching, Mathematical Structures in Computer Science, vol.12, issue.4, p.13, 2002.

S. Lazebnik, C. Schmid, and J. Ponce, Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories, p.2006, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00548585

, IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2006, pp.2169-2178, 2006.

M. Leeuwen, T. D. Van, E. Bie, C. Spyropoulou, and . Mesnage, Subjective interestingness of subgraph patterns, Machine Learning, vol.105, p.25, 2016.

F. Li, R. Fergus, and P. Perona, Learning Generative Visual Models from Few Training Examples: An Incremental Bayesian Approach Tested on 101 Object Categories, IEEE Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops, vol.87, p.85, 2004.

D. G. Lowe, Distinctive Image Features from Scale-Invariant Keypoints, International Journal of Computer Vision, vol.60, issue.2, p.80, 2004.

H. Mannila and H. Toivonen, Levelwise Search and Borders of Theories in Knowledge Discovery, Data Min. Knowl. Discov, vol.1, issue.3, p.24, 1997.

D. E. Marco, S. A. Páez, and S. A. Cannas, Species invasiveness in biological invasions: a modelling approach, Biological Invasions, vol.4, issue.1, p.98, 2002.

D. W. Matula, In: Algorithmic Aspects of Combinatorics, Annals of Discrete Mathematics, vol.2, p.13, 1978.

C. Mccreesh and P. Prosser, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs, Principles and Practice of Constraint Programming -21st International Conference, vol.9255, p.13, 2015.

J. J. Mcgregor, Relational consistency algorithms and their application in finding subgraph and graph isomorphisms, Inf. Sci, vol.19, issue.3, p.13, 1979.

B. D. Mckay, Practical graph isomorphism" (cit, p.12, 1981.

S. Nijssen, J. N. Kok, ;. W. Kim, R. Kohavi, J. Gehrke et al., A quickstart in frequent structure mining can make a difference, Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004.

. Dumouchel and . Acm, , p.41

M. Nilsback and A. Zisserman, Automated Flower Classification over a Large Number of Classes, Sixth Indian Conference on Computer Vision, Graphics & Image Processing, p.85, 2008.

E. Nowak, F. Jurie, and B. Triggs, Sampling Strategies for Bag-ofFeatures Image Classification, Computer Vision -ECCV 2006, 9th European Conference on Computer Vision, vol.3954, p.81, 2006.

S. Nowozin, K. Tsuda, T. Uno, T. Kudo, and G. H. Bakir, Weighted Substructure Mining for Image Analysis, IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2007), p.81, 2007.

F. Odone, A. Barla, and A. Verri, Building kernels from binary strings for image matching, IEEE Trans. Image Processing, vol.14, issue.2, pp.169-180, 2005.

B. Özdemir and S. Aksoy, Image Classification Using Subgraph Histogram Representation, 20th International Conference on Pattern Recognition, ICPR 2010, p.80, 2010.

J. Pei and J. Han, Can We Push More Constraints into Frequent Pattern Mining?, In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD '00, p.27, 2000.

J. Pei, J. Han, and L. V. Lakshmanan, Pushing Convertible Constraints in Frequent Itemset Mining, Data Min. Knowl. Discov, vol.8, issue.3, p.27, 2004.

G. Piatetsky-shapiro and C. J. Matheus, The Interingness of Deviations, In: Knowledge Discovery in Databases: Papers from the 1994 AAAI Workshop, p.28, 1994.

A. Prado, B. Jeudy, É. Fromont, and F. Diot, Mining spatiotemporal patterns in dynamic plane graphs, Intell. Data Anal, vol.17, issue.1, pp.71-92, 2013.
URL : https://hal.archives-ouvertes.fr/ujm-00629121

M. Rastegari, V. Ordonez, J. Redmon, and A. Farhadi, XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networks, Computer Vision -ECCV 2016 -14th European Conference, 2016.

J. Leibe, N. Matas, M. Sebe, and . Welling, Lecture Notes in Computer Science, vol.9908, p.94

J. Régin, A Filtering Algorithm for Constraints of Difference in CSPs, Proceedings of the 12th National Conference on Artificial Intelligence, vol.1, p.13, 1994.

P. W. Rendell, Turing machine universality of the game of life, p.100, 2014.

V. L. Saint-marcq, P. De, C. Schaus, C. Solnon, and . Lecoutre, Sparsesets for domain implementation, CP workshop on Techniques foR Implementing Constraint programming Systems (TRICS), p.69, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01339250

É. Samuel, C. De-la-higuera, and J. Janodet, Extracting Plane Graphs from Images, Structural, Syntactic, and Statistical Pattern Recognition, vol.6218, pp.233-243, 2010.
URL : https://hal.archives-ouvertes.fr/ujm-00531224

F. B. Silva, S. Goldenstein, S. Tabbone, R. Da-silva, and . Torres, Image classification based on bag of visual graphs, IEEE International Conference on Image Processing, pp.4312-4316, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00939183

F. B. Silva, S. Tabbone, R. Da-silva, and . Torres, BoG: A New Approach for Graph Matching, 22nd International Conference on Pattern Recognition, ICPR, pp.82-87, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01098679

K. Smets and J. Vreeken, Slim: Directly Mining Descriptive Patterns, SDM. SIAM / Omnipress, p.28, 2012.

C. Solnon, AllDifferent-based filtering for subgraph isomorphism, Artif. Intell, vol.174, p.13, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01381476

C. Solnon, G. Damiand, C. De-la-higuera, and J. Janodet, On the complexity of submap isomorphism and maximum common submap problems, Pattern Recognition, vol.48, issue.2, pp.302-316, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01022418

S. Sorlin and C. Solnon, A parametric filtering algorithm for the graph isomorphism problem, Constraints, vol.13, issue.4, p.12, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01500328

A. Soulet and B. Crémilleux, An Efficient Framework for Mining Flexible Constraints, Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference, PAKDD 2005, vol.3518, p.28, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00324837

M. M. Syslo, The Subgraph Isomorphism Problem for Outerplanar Graphs, Theor. Comput. Sci, vol.17, p.13, 1982.

J. R. Ullmann, An Algorithm for Subgraph Isomorphism, J. ACM, vol.23, issue.1, p.12, 1976.

N. Vanetik, E. Gudes, and S. E. Shimony, Computing Frequent Graph Patterns from Semistructured Data, Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002, p.35, 2002.

W. Voravuthikunchai, B. Crémilleux, and F. Jurie, Histograms of Pattern Sets for Image Classification and Object Recognition, 2014 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2014, Columbus, p.80, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00980894

J. Vreeken, M. Van-leeuwen, and A. Siebes, Krimp: mining itemsets that compress, Data Min. Knowl. Discov, vol.23, issue.1, p.28, 2011.

J. Wang, Z. Zeng, and L. Zhou, CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases, Proceedings of the 22nd International Conference on Data Engineering, p.42, 2006.

S. Wolfram, Cellular automata as models of complexity, Nature, issue.5985, p.98, 1984.

J. T. Wootton, Local interactions predict large-scale pattern in empirically derived cellular automata, Nature, issue.6858, p.98, 2001.

M. Wörlein, T. Meinl, I. Fischer, M. Philippsen-;-gspan, F. Gaston et al., A Quantitative Comparison of the Subgraph Miners MoFa, Knowledge Discovery in Databases: PKDD 2005, 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, vol.3721, p.41, 2005.

X. Yan and J. Han, gSpan: Graph-Based Substructure Pattern Mining, Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002, vol.32, pp.34-36, 2002.

, CloseGraph: mining closed frequent graph patterns, Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, vol.73, pp.286-295, 2003.

, Discovery of frequent substructures, vol.5, p.27, 2006.

Z. Zeng, J. Wang, L. Zhou, and G. Karypis, Coherent closed quasiclique discovery from large dense graph databases, Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, p.42, 2006.

S. Zhang, J. Yang, and V. Cheedella, Monkey: Approximate Graph Mining Based on Spanning Trees, Proceedings of the 23rd International Conference on Data Engineering, p.44, 2007.

S. Zhang and J. Yang, In: Scientific and Statistical Database Management, 20th International Conference, SSDBM, vol.5069, p.44, 2008.

F. Zhu, Q. Qu, D. Lo, X. Yan, J. Han et al., Mining Top-K Large Structural Patterns in a Massive Network, PVLDB, vol.4, issue.11, p.46, 2011.

Z. Zou, J. Li, H. Gao, and S. Zhang, Frequent subgraph pattern mining on uncertain graph data, Proceedings of the 18th ACM Conference on Information and Knowledge Management, p.45, 2009.

. .. , 27 3.2 A graph (a) and three possible DFS tree (b), (c) and (d) . . . . 32 3.3 Example of a partial search space

, Example of graphs isomorphic for gSpan but not isomorphic for FreqGeo

. .. Grids, 49 4.2 2D grids, induced and partial 2D subgrids

.. .. 2d-+-t-grid,

. .. Induced, , p.54

.. .. 2d-+-t-subgrid-isomorphism,

. .. Sub-isomorphism-relations, , p.61

A. .. 2d-+-t-grid, , p.62

, A subset of the search space explored by GriMA, p.68

, An illustration of node-induced pattern in a complete 2D grid, vol.74

, 79 6.2 Representation of an image by a 2D grid of visual words, p.82

, From images to grids of visual words with holes, p.83

. .. Automorphism-of-patterns,

. .. Dataset, , vol.87

, Overview of the learning process

, Overview of the testing process

, Efficiency results of GriMA, i-GriMA, gSpan and Plagram 91

, 99 7.2 Examples of initial states with stable and periodic outcomes, p.100

, Examples of grids: 4 first states and last 3 states, for each class, vol.102

, Efficiency GriMA and gSpan to mine 2D + t grids, p.106

, Efficiency of GriMA and LAD to enumerate pattern in grid, vol.108

, 22 3.1 DFS codes for the corresponding DFS trees of Figure 3.2 . . . . 32 3.2 Characteristics of subgraph mining algorithms, 2018.

, Image dataset information summary, 92 6.3 Classification rates of binary SVMs for, vol.7, pp.15-93

. .. , 109 7.2 Confusion matrices for game of life classification