Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal, Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets, Proc. of CL'00. Volume 1861 of LNAI, pp.972-986, 2000.
DOI : 10.1007/3-540-44957-4_65
URL : https://hal.archives-ouvertes.fr/hal-00467751

M. Kryszkiewicz, Representative association rules, Proc. of PAKDD '98, pp.198-209, 1998.
DOI : 10.1007/3-540-64383-4_17

J. L. Guigues and V. Duquenne, Familles minimales d'implications informatives résultant d'un tableau de données binaires, Math. et Sci. Hum, pp.95-100, 1986.

M. Luxenburger, Implications partielles dans un contexte, Mathématiques, Informatique et Sciences Humaines, vol.113, pp.35-55, 1991.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Closed set based discovery of small covers for association rules, Proc. of BDA '99, pp.361-381, 1999.

M. Kryszkiewicz, Concise Representations of Association Rules, Proc. of the ESF Exploratory Workshop on Pattern Detection and Discovery, pp.92-109, 2002.
DOI : 10.1007/3-540-45728-3_8

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Efficient mining of association rules using closed itemset lattices, Information Systems, vol.24, issue.1, pp.25-46, 1999.
DOI : 10.1016/S0306-4379(99)00003-4

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Discovering Frequent Closed Itemsets for Association Rules, LNCS, vol.1540, pp.398-416, 1999.
DOI : 10.1007/3-540-49257-7_25
URL : https://hal.archives-ouvertes.fr/hal-00467747

M. J. Zaki and C. J. Hsiao, CHARM: An Efficient Algorithm for Closed Itemset Mining, Proc. of SDM '02, pp.33-43, 2002.
DOI : 10.1137/1.9781611972726.27

M. Kryszkiewicz, Concise representation of frequent patterns based on disjunctionfree generators, Proc. of ICDM '01, pp.305-312, 2001.

J. F. Boulicaut, A. Bykowski, and C. Rigotti, Approximation of Frequency Queries by Means of Free-Sets, Proc. of PKDD '00, pp.75-85, 2000.
DOI : 10.1007/3-540-45372-5_8

A. Bykowski and C. Rigotti, A condensed representation to find frequent patterns, Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '01, pp.267-273, 2001.
DOI : 10.1145/375551.375604

M. Kryszkiewicz and M. Gajek, Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns?, Proc. of ISMIS 2002, pp.383-392, 2002.
DOI : 10.1007/3-540-48050-1_42

T. Calders and B. Goethals, Mining All Non-derivable Frequent Itemsets, Proc. of PKDD '02, pp.74-85, 2002.
DOI : 10.1007/3-540-45681-3_7
URL : http://arxiv.org/abs/cs/0206004

N. Pasquier, Mining association rules using formal concept analysis, Proc. of ICCS '00, pp.259-264, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00467752

Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal, Mining frequent patterns with counting inference, ACM SIGKDD Explorations Newsletter, vol.2, issue.2, pp.66-75, 2000.
DOI : 10.1145/380995.381017
URL : https://hal.archives-ouvertes.fr/hal-00467750

L. Szathmary, Symbolic Data Mining Methods with the Coron Platform (Méthodes symboliques de fouille de données avec la plate-forme Coron) PhD in Computer Sciences, 2006.

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

L. Szathmary, A. Napoli, and S. O. Kuznetsov, ZART : A Multifunctional Itemset Mining Algorithm, LORIA Research Report, p.1271, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00189423

L. Szathmary and A. Napoli, CORON: A Framework for Levelwise Itemset Mining Algorithms, Suppl. Proc. of ICFCA '05, pp.110-113, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00001201