R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules in Large Databases, Proc. of the 20th Intl. Conf. on Very Large Data Bases (VLDB '94), pp.487-499, 1994.

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

Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal, Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets Volume 1861 of LNAI, Proc. of the Computational Logic (CL '00), pp.972-986, 2000.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Discovering Frequent Closed Itemsets for Association Rules, Proc. of the 7th Intl. Conf. on Database Theory (ICDT '99), pp.398-416, 1999.
DOI : 10.1007/3-540-49257-7_25
URL : https://hal.archives-ouvertes.fr/hal-00467747

G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, and L. Lakhal, Computing iceberg concept lattices with Titanic, Data & Knowledge Engineering, vol.42, issue.2, pp.189-222, 2002.
DOI : 10.1016/S0169-023X(02)00057-5
URL : https://hal.archives-ouvertes.fr/hal-00578830

M. J. Zaki and C. J. 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.520

M. J. Zaki, Mining Non-Redundant Association Rules, Data Mining and Knowledge Discovery, vol.9, issue.3, pp.223-248, 2004.
DOI : 10.1023/B:DAMI.0000040429.96086.c7

M. J. Zaki and C. J. 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://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.1296

M. J. Zaki and N. Ramakrishnan, Reasoning about sets using redescription mining, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , KDD '05, pp.364-373, 2005.
DOI : 10.1145/1081870.1081912
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.1242

R. Godin and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science, vol.133, issue.2, pp.387-419, 1994.
DOI : 10.1016/0304-3975(94)90195-3

J. L. 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.
DOI : 10.1007/3-540-45832-8_26

L. Floc-'h, A. Fisette, C. Missaoui, R. Valtchev, P. Godin et al., JEN : un algorithme efficace de construction de générateurs pour l'identification des r` egles d'association. Nouvelles Technologies de l, pp.135-146, 2003.

L. Szathmary, P. Valtchev, A. Napoli, and R. Godin, Efficient Vertical Mining of Frequent Closures and Generators, Proc. of the 8th Intl. Symposium on Intelligent Data Analysis (IDA '09, pp.393-404, 2009.
DOI : 10.1007/978-3-540-88411-8_15
URL : https://hal.archives-ouvertes.fr/inria-00618805

L. Szathmary, P. Valtchev, A. Napoli, and R. Godin, Constructing Iceberg Lattices from Frequent Closures Using Generators, In: Discovery Science, vol.5255, pp.136-147, 2008.
DOI : 10.1007/978-3-540-88411-8_15
URL : https://hal.archives-ouvertes.fr/inria-00331524

T. Calders, C. Rigotti, and J. F. Boulicaut, A Survey on Condensed Representations for Frequent Sets, Constraint- Based Mining and Inductive Databases, pp.64-80, 2004.
DOI : 10.1007/11615576_4

J. Baixeries, L. Szathmary, P. Valtchev, and R. Godin, Yet a Faster Algorithm for Building the Hasse Diagram of a Galois Lattice, Proc. of the 7th Intl. Conf. on Formal Concept Analysis (ICFCA '09, pp.162-177, 2009.

N. Pasquier, Mining association rules using formal concept analysis, Proc. of the 8th Intl. Conf. on Conceptual Structures (ICCS '00), Shaker-Verlag, pp.259-264, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00467752

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

J. Pei, J. Han, and R. Mao, CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets, In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp.21-30, 2000.

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.

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

T. Calders and B. 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

L. Szathmary, A. Napoli, and S. O. 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

M. J. Zaki and K. 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

J. L. Pfaltz and C. M. Taylor, Scientific Knowledge Discovery through Iterative Transformation of Concept Lattices, Proc. of the SIAM Workshop on Data Mining and Discrete Mathematics, pp.65-74, 2002.

A. Philippon, G. Arlet, and G. A. Jacoby, Plasmid-Determined AmpC-Type ??-Lactamases, Antimicrobial Agents and Chemotherapy, vol.46, issue.1, pp.1-11, 2002.
DOI : 10.1128/AAC.46.1.1-11.2002
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC126993

T. Schwartz, W. Kohnen, B. Jansen, and U. Obst, Detection of antibiotic-resistant bacteria and their resistance genes in wastewater, surface water, and drinking water biofilms, FEMS Microbiology Ecology, vol.43, issue.3, pp.325-335, 2003.
DOI : 10.1111/j.1574-6941.2003.tb01073.x