R. C. Agarwal, C. C. Aggarwal, and V. V. Prasad, Depth first generation of long patterns, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '00, pp.108-118, 2000.
DOI : 10.1145/347090.347114

R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo, Fast discovery of association rules, Advances in knowledge discovery and data mining, pp.307-328, 1996.

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

R. J. Bayardo, Efficiently mining long patterns from databases, Proc. of SIGMOD '98, pp.85-93, 1998.
DOI : 10.1145/276305.276313

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.1120

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

E. Boros, V. Gurvich, L. Khachiyan, and K. Makino, On maximal frequent and minimal infrequent sets in binary matrices, Annals of Mathematics and Artificial Intelligence, vol.39, issue.3, pp.211-221, 2003.
DOI : 10.1023/A:1024605820527

B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, 2002.
DOI : 10.1017/CBO9780511809088

K. Gouda and M. J. Zaki, Efficiently mining maximal frequent itemsets, Proceedings 2001 IEEE International Conference on Data Mining, pp.163-170, 2001.
DOI : 10.1109/ICDM.2001.989514

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.4333

Y. Koh and N. Rountree, Finding Sporadic Rules Using Apriori-Inverse, Proc. of PAKDD '05, pp.97-106, 2005.
DOI : 10.1007/11430919_13

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.269.6823

M. Kryszkiewicz, Concise representation of frequent patterns based on disjunction-free generators, Proceedings 2001 IEEE International Conference on Data Mining, pp.305-312, 2001.
DOI : 10.1109/ICDM.2001.989533

B. Liu, W. Hsu, Y. Ma, H. Liu, H. Lu et al., Mining association rules with multiple minimum supports Efficient Search of Reliable Exceptions, Proc. of SIGKDD '99 Proc. of PAKDD '99, pp.337-341, 1999.

H. Mannila and H. Toivonen, Levelwise Search and Borders of Theories in Knowledge Discovery, Data Mining and Knowledge Discovery, vol.1, issue.3, pp.241-258, 1997.
DOI : 10.1023/A:1009796218281

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

G. Siest, Objectives, Design and Recruitment of a Familial and Longitudinal Cohort for Studying Gene-Environment Interactions in the Field of Cardiovascular Risk: The Stanislas Cohort, Clinical Chemistry and Laboratory Medicine, vol.36, issue.1, pp.35-42, 1998.
DOI : 10.1515/CCLM.1998.007

E. Suzuki, UNDIRECTED DISCOVERY OF INTERESTING EXCEPTION RULES, 17] 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, pp.1065-1086, 2002.
DOI : 10.1142/S0218001402002155

L. Szathmary, S. Maumus, P. Petronin, Y. Toussaint, and A. Napoli, Vers l'extraction de motifs rares, Proc. of Extraction et gestion des connaissances (EGC '06), pp.499-510, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00001151

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

G. Weiss, Mining with rarity, ACM SIGKDD Explorations Newsletter, vol.6, issue.1, pp.7-19, 2004.
DOI : 10.1145/1007730.1007734

H. Yun, D. Ha, B. Hwang, and K. Ryu, Mining association rules on significant rare data using relative support, Journal of Systems and Software, vol.67, issue.3, pp.181-191, 2003.
DOI : 10.1016/S0164-1212(02)00128-0