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

. Boros, An Intersection Inequality for Discrete Distributions and Related Generation Problems, International Colloquium on Automata, Languages and Programming (ICALP), pp.543-555, 2003.
DOI : 10.1007/3-540-45061-0_44

G. Calders, B. Calders, and . Goethals, Depth-First Non-Derivable Itemset Mining, SIAM International Conference on Data Mining, 2005. [Ganter and Kuznetsov, 2001] B. Ganter and S. O. Kuznetsov. Pattern structures and their projections, 2005.
DOI : 10.1137/1.9781611972757.23

W. Ganter, R. Ganter, and . Wille, Formal Concept Analysis, 1999.

. Kaytoue, Pattern mining in numerical data: extracting closed patterns and their generators Mining gene expression data with pattern structures in formal concept analysis, Inf. Sci, issue.10, pp.1811989-2001, 2010.

. Kuznetsov, ]. S. Obiedkov, S. A. Kuznetsov, and . Obiedkov, Comparing performance of algorithms for generating concept lattices, Journal of Experimental & Theoretical Artificial Intelligence, vol.21, issue.2-3, pp.189-216, 2002.
DOI : 10.1016/S0020-0190(99)00108-8

. Li, Minimum description length principle: Generators are preferable to closed patterns In Innovative Applications of Artificial Intelligence Conference Positive borders or negative borders: How to make lossless generator based representations concise, SIAM Int. Conf. on Data Mining, 2006.

A. Srikant, R. Srikant, and . Agrawal, Mining quantitative association rules in large relational tables, ACM SIGMOD Int. Conf. on Management of Data, pp.1-12, 1996.

. Stumme, Computing iceberg concept lattices with titanic Lcm ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets, IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2002.