H. Cheng, X. Yan, and J. Han, Mining Graph Patterns, Freq. Pattern Min, pp.307-338, 2014.

Z. Zeng, J. Wang, J. Zhang, and L. Zhou, FOGGER, Proceedings of the 12th International Conference on Extending Database Technology Advances in Database Technology, EDBT '09, pp.517-528, 2009.
DOI : 10.1145/1516360.1516421

M. Boley, T. Horváth, A. Poigné, and S. Wrobel, Listing closed sets of strongly accessible set systems with applications to data mining, Theoretical Computer Science, vol.411, issue.3, pp.691-700, 2010.
DOI : 10.1016/j.tcs.2009.10.024

S. O. Kuznetsov, On stability of a formal concept, Annals of Mathematics and Artificial Intelligence, vol.8, issue.3, pp.101-115, 2007.
DOI : 10.1007/978-94-009-7798-3_15

N. Tatti, F. Moerchen, and T. Calders, Finding Robust Itemsets under Subsampling, ACM Transactions on Database Systems, vol.39, issue.3, pp.1-27, 2014.
DOI : 10.1007/s10994-007-5006-x

C. Roth, S. A. Obiedkov, and D. G. Kourie, ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS, International Journal of Foundations of Computer Science, vol.69, issue.02, pp.383-404, 2008.
DOI : 10.1007/3-540-61534-2_2

F. Moerchen, M. Thies, and A. Ultsch, Efficient mining of all margin-closed itemsets with applications in temporal knowledge discovery and classification by compression, Knowledge and Information Systems, vol.9, issue.3, pp.55-80, 2011.
DOI : 10.1023/B:DAMI.0000040429.96086.c7

A. Soulet and B. Crémilleux, Optimizing Constraint-Based Mining by Automatically Relaxing Constraints, Fifth IEEE International Conference on Data Mining (ICDM'05), pp.777-780, 2005.
DOI : 10.1109/ICDM.2005.112
URL : https://hal.archives-ouvertes.fr/hal-00324838

A. Soulet and B. Cremilleux, Adequate condensed representations of patterns, Data Mining and Knowledge Discovery, vol.12, issue.3, pp.94-110, 2008.
DOI : 10.1007/s10618-008-0111-4
URL : https://hal.archives-ouvertes.fr/hal-01024051

A. Buzmakov, S. O. Kuznetsov, and A. Napoli, Fast Generation of Best Interval Patterns for Nonmonotonic Constraints, Mach. Learn. Knowl. Discov. Databases, ser, pp.157-172, 2015.
DOI : 10.1007/978-3-319-23525-7_10
URL : https://hal.archives-ouvertes.fr/hal-01186718

B. Ganter and S. O. Kuznetsov, Pattern Structures and Their Projections, Concept. Struct. Broadening Base, ser, pp.129-142, 2001.
DOI : 10.1007/3-540-44583-8_10
URL : http://www.math.tu-dresden.de/~ganter/psfiles/kuznet.ps

M. Kaytoue, V. Codocedo, A. Buzmakov, J. Baixeries, S. O. Kuznetsov et al., Pattern Structures and Concept Lattices for Data Mining and Knowledge Processing, Mach. Learn. Knowl. Discov. Databases, ser, pp.227-231, 2015.
DOI : 10.1007/978-3-319-23461-8_19
URL : https://hal.archives-ouvertes.fr/hal-01188637

X. Yan and J. Han, CloseGraph, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.286-295, 2003.
DOI : 10.1145/956750.956784

S. O. Kuznetsov, Learning of Simple Conceptual Graphs from Positive and Negative Examples, Princ Discov. SE -47, ser. LNCS. Springer, pp.384-391, 1999.
DOI : 10.1007/978-3-540-48247-5_47

S. O. Kuznetsov and M. V. Samokhin, Learning Closed Sets of Labeled Graphs for Chemical Applications, Inductive Log. Program. SE -12, ser, pp.190-208, 2005.
DOI : 10.1007/11536314_12

B. Efron, Bootstrap Methods: Another Look at the Jackknife, The Annals of Statistics, vol.7, issue.1, pp.1-26, 1979.
DOI : 10.1214/aos/1176344552

A. Buzmakov, S. O. Kuznetsov, and A. Napoli, Scalable Estimates of Concept Stability, Form. Concept Anal., ser. LNCS. Springer, pp.161-176, 2014.
DOI : 10.1007/978-3-319-07248-7_12
URL : https://hal.archives-ouvertes.fr/hal-01095920

D. G. Kourie, S. A. Obiedkov, B. W. Watson, and D. Van-der-merwe, An incremental algorithm to construct a lattice of set intersections, Science of Computer Programming, vol.74, issue.3, pp.128-142, 2009.
DOI : 10.1016/j.scico.2008.09.015

S. Nijssen and J. N. Kok, The Gaston Tool for Frequent Subgraph Mining, Electronic Notes in Theoretical Computer Science, vol.127, issue.1, pp.77-87, 2005.
DOI : 10.1016/j.entcs.2004.12.039

X. Yan and J. Han, gSpan: Graph-Based Substructure Pattern Mining, IEEE International Conference on Data Mining, pp.721-724, 2002.

J. Métivier, A. Lepailleur, A. Buzmakov, G. Poezevara, B. Crémilleux et al., Discovering Structural Alerts for Mutagenicity Using Stable Emerging Molecular Patterns, Journal of Chemical Information and Modeling, vol.55, issue.5, pp.925-940, 2015.
DOI : 10.1021/ci500611v

M. J. Zaki and C. Hsiao, Efficient algorithms for mining closed itemsets and their lattice structure, IEEE Transactions on Knowledge and Data Engineering, vol.17, issue.4, pp.462-478, 2005.
DOI : 10.1109/TKDE.2005.60
URL : http://www.cs.rpi.edu/~zaki/./PS/TKDE05.pdf