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.

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.

M. Kryszkiewicz, Representative association rules, Proc. of the 2nd Pacific- Asia Conf. on Research and Development in Knowledge Discovery and Data Mining (PAKDD '98), pp.198-209, 1998.
DOI : 10.1007/3-540-64383-4_17

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

V. Duquenne, Contextual implications between attributes and some representational properties for finite lattices, Beitraege zur Begriffsanalyse, B.I. Wissenschaftsverlag , Mannheim, pp.213-239, 1987.

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

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, 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

P. Valtchev, R. Missaoui, and R. Godin, Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges, Proc. of the 2nd Intl. Conf. on Formal Concept Analysis, pp.352-371, 2004.
DOI : 10.1007/978-3-540-24651-0_30

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, Scalable algorithms for association mining, IEEE Transactions on Knowledge and Data Engineering, vol.12, issue.3, pp.372-390, 2000.
DOI : 10.1109/69.846291

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

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.

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

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

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.

J. Han, J. Pei, and Y. Yin, Mining frequent patterns without candidate generation, Proc. of the 2000 ACM SIGMOD Intl. Conf. on Management of Data (SIGMOD '00), pp.1-12, 2000.

L. Szathmary, Symbolic Data Mining Methods with the Coron Platform, 2006.
URL : https://hal.archives-ouvertes.fr/tel-00336374