[. Agrawal, T. Imielinski, and A. Swami, Mining associations between sets of items in massive databases Fast algorithms for mining association rules, Proc. of the ACM-SIGMOD 1993 Int. Conf. on Management of DataAS94] Rakesh Agrawal and Ramakrishnan Srikant Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pp.207-216, 1993.

[. Brin, R. Motwani, J. D. Ullman, and S. Tsur, Dynamic itemset counting and implication rules for market basket data, Proc. ACM SIGMOD Int. Conf. on Management of Data Calcul pratique du treillis de Galois d'une correspondance. Mathématiques, Informatiques et Sciences Humaines, pp.255-264, 1986.

P. Cellier, S. Ferré, O. Ridoux, and M. Ducassé, An algorithm to find frequent concepts of a formal context with taxonomy Sébastien Ferré and Olivier Ridoux. An introduction to logical information systems, Concept Lattices and Their ApplicationsGW99] Bernhard Ganter and Rudolf Wille. Formal Concept Analysis: Mathematical Foundations, pp.383-419, 1999.

S. O. Kuznetsov, Machine Learning and Formal Concept Analysis, International Conference Formal Concept Analysis, pp.287-312, 2004.
DOI : 10.1007/978-3-540-24651-0_25

T. Mitchell, . Machine, and . Learning, [Pas00] Nicolas Pasquier Data Mining : Algorithmes d'extraction et de réduction des r` egles d'association dans les bases de données, Computer science, 1997.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Discovering Frequent Closed Itemsets for Association Rules, Proc. of the 7th Int. Conf. on Database TheoryPR03] Yoann Padioleau and Olivier Ridoux. A logic file system Proc. USENIX Annual Technical ConferenceSR06] Benjamin Sigonneau and Olivier Ridoux. Indexation multiple et automatisée de composants logiciels. Technique et Science Informatiques, pp.398-416, 1999.
DOI : 10.1007/3-540-49257-7_25
URL : https://hal.archives-ouvertes.fr/hal-00467747

J. Mohammed and . Zaki, Mining non-redundant association rules, Data Mining Knowl. Discov, vol.9, issue.3, pp.223-248, 2004.