J. Han, H. Cheng, D. Xin, and X. Yan, Frequent pattern mining: current status and future directions, Data Mining and Knowledge Discovery, vol.1, issue.1, pp.55-86, 2007.
DOI : 10.1007/s10618-006-0059-1

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

D. Marchi, F. Petit, and J. , Zigzag: a new algorithm for mining large inclusion dependencies in databases, Third IEEE International Conference on Data Mining, pp.27-34, 2003.
DOI : 10.1109/ICDM.2003.1250899

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

R. Abreu and A. Van-gemund, A Low-Cost Approximate Minimal Hitting Set Algorithm and its Application to Model-Based Diagnosis, SARA'09, 2009.

D. P. Ruchkys and S. W. Song, A parallel approximation hitting set algorithm for gene expression analysis, 14th Symposium on Computer Architecture and High Performance Computing, 2002. Proceedings., pp.75-81, 2002.
DOI : 10.1109/CAHPC.2002.1180762
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.8443

S. Moens and B. Goethals, Randomly sampling maximal itemsets, Proceedings of the ACM SIGKDD Workshop on Interactive Data Exploration and Analytics, IDEA '13, pp.79-86, 2013.
DOI : 10.1145/2501511.2501523
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.353.2537

J. Vreeken, M. Van-leeuwen, and A. Siebes, Krimp: mining itemsets that compress, Data Mining and Knowledge Discovery, vol.177, issue.1, 2011.
DOI : 10.1007/s10618-010-0202-x

F. Afrati, A. Gionis, and H. Mannila, Approximating a collection of frequent sets, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '04, pp.12-19, 2004.
DOI : 10.1145/1014052.1014057

M. Hagen, Algorithmic and Computational Complexity Issues of MONET, 2008.

S. Vinterbo and A. Øhrn, Minimal approximate hitting sets and rule templates, International Journal of Approximate Reasoning, vol.25, issue.2, pp.123-143, 2000.
DOI : 10.1016/S0888-613X(00)00051-7
URL : http://doi.org/10.1016/s0888-613x(00)00051-7

F. Rioult, B. Zanuttini, and B. Crémilleux, Nonredundant Generalized Rules and Their Impact in Classification, Advances in Intelligent Information Systems, pp.3-25, 2010.
DOI : 10.1007/978-3-642-05183-8_1
URL : https://hal.archives-ouvertes.fr/hal-00944355

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

K. Satoh and T. Uno, Enumerating Maximal Frequent Sets Using Irredundant Dualization, DS'03, pp.256-268, 2003.
DOI : 10.1007/978-3-540-39644-4_22

G. Dong and J. Li, Mining border descriptions of emerging patterns from dataset pairs, Knowledge and Information Systems, vol.1, issue.2, pp.178-202, 2005.
DOI : 10.1016/S1535-6108(02)00032-6