C. Berge, Hypergraphs: Combinatorics of Finite Sets, 1989.

. Btp-+-00a-]-y, R. Bastide, N. Taouil, G. Pasquier, L. Stumme et al., Mining frequent patterns with counting inference, SIGKDD Explor. Newsl, vol.2, issue.2, pp.66-75, 2000.

. Btp-+-00b-]-y, R. Bastide, N. Taouil, G. Pasquier, L. Stumme et al., Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets, Proc. of the Computational Logic (CL '00), volume 1861 of LNAI, pp.972-986, 2000.

B. [. Calders and . Goethals, Depth-First Non-Derivable Itemset Mining, Proc. of the SIAM Intl. Conf. on Data Mining (SDM '05), 2005.
DOI : 10.1137/1.9781611972757.23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.7914

G. [. Eiter and . Gottlob, Identifying the Minimal Transversals of a Hypergraph and Related Problems, SIAM Journal on Computing, vol.24, issue.6, pp.1278-1304, 1995.
DOI : 10.1137/S0097539793250299

V. [. Guigues and . Duquenne, Familles minimales d'implications informatives résultant d'un tableau de données binaires, Mathématiques et Sciences Humaines, vol.95, pp.5-18, 1986.

]. B. Goe03 and . Goethals, Survey on Frequent Pattern Mining, 2003.

R. [. Ganter and . Wille, Formal concept analysis: mathematical foundations, 1999.

]. M. Kry98 and . Kryszkiewicz, Representative Association Rules, Proc. of the 2nd

]. M. Kry02 and . Kryszkiewicz, Concise Representations of Association Rules, Proc. of the ESF Exploratory Workshop on Pattern Detection and Discovery, pp.92-109, 2002.

E. [. Kavvadias and . Stavropoulos, An Efficient Algorithm for the Transversal Hypergraph Generation, Journal of Graph Algorithms and Applications, vol.9, issue.2, pp.239-264, 2005.
DOI : 10.7155/jgaa.00107

]. A. Lffm-+-03, C. Le-floc-'h, R. Fisette, P. Missaoui, R. Valtchev et al., JEN : un algorithme efficace de construction de générateurs pour l'identification des règles d'association. Numéro spécial de la revue des Nouvelles Technologies de l'Information, pp.135-146, 2003.

]. N. Pas00 and . Pasquier, Mining association rules using formal concept analysis, Proc. of the 8th Intl. Conf. on Conceptual Structures (ICCS '00), pp.259-264, 2000.

]. N. Pbtl99a, Y. Pasquier, R. Bastide, L. Taouil, and . Lakhal, Closed set based discovery of small covers for association rules, Proc. 15emes Journees Bases de Donnees Avancees (BDA), pp.361-381, 1999.

]. N. Pbtl99b, Y. Pasquier, R. Bastide, L. Taouil, and . Lakhal, Discovering frequent closed itemsets for association rules, Lecture Notes in Computer Science, vol.1540, pp.398-416, 1999.

]. J. Pfa02 and . Pfaltz, Incremental Transformation of Lattices: A Key to Effective Knowledge Discovery, Proc. of the First Intl. Conf. on Graph Transformation (ICGT '02), pp.351-362, 2002.

R. [. Pfaltz and . Jamison, Closure systems and their structure, Information Sciences, vol.139, issue.3-4, pp.3-4275, 2001.
DOI : 10.1016/S0020-0255(01)00169-4

A. [. Szathmary and . Napoli, CORON: A Framework for Levelwise Itemset Mining Algorithms, Supplementary Proc. of the 3rd Intl. Conf. on Formal Concept Analysis (ICFCA '05), pp.110-113, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00001201

A. [. Szathmary, S. O. Napoli, and . Kuznetsov, ZART: A Multifunctional Itemset Mining Algorithm, Proc. of the 5th Intl. Conf. on Concept Lattices and Their Applications (CLA '07), pp.26-37, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00189423

. Stb-+-02-]-g, R. Stumme, Y. Taouil, N. Bastide, L. Pasquier et al., Computing Iceberg Concept Lattices with TITANIC, Data and Knowledge Engineering, vol.42, issue.2, pp.189-222, 2002.

]. L. Sza06 and . Szathmary, Symbolic Data Mining Methods with the Coron Platform, 2006.

]. M. Zak00 and . Zaki, Scalable Algorithms for Association Mining, IEEE Transactions on Knowledge and Data Engineering, vol.12, issue.3, pp.372-390, 2000.

K. [. Zaki and . Gouda, Fast vertical mining using diffsets, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.326-335, 2003.
DOI : 10.1145/956750.956788
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.5466

C. [. Zaki and . Hsiao, CHARM: An Efficient Algorithm for Closed Itemset Mining, SIAM Intl. Conf. on Data Mining (SDM' 02), pp.33-43, 2002.
DOI : 10.1137/1.9781611972726.27

M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li, New Algorithms for Fast Discovery of Association Rules, Proc. of the 3rd Intl. Conf. on Knowledge Discovery in Databases, pp.283-286, 1997.

I. Centre-de-recherche, ?. Nancy, and L. Est, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès