C. C. Aggarwal and J. Han, Frequent pattern mining, 2014.

A. Barron, J. Rissanen, and B. Yu, The minimum description length principle in coding and modeling, IEEE Transactions on Information Theory, vol.44, issue.6, pp.2743-2760, 1998.

R. Belohlavek and M. Trnecka, From-below approximations in boolean matrix factorization: Geometry and new algorithm, Journal of Computer and System Sciences, vol.81, issue.8, pp.1678-1697, 2015.

F. Coenen, The lucs-kdd discretised/normalised arm and carm data library, 2003.

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

P. D. Grünwald, The minimum description length principle, 2007.

M. H. Hansen and B. Yu, Model selection and the principle of minimum description length, Journal of the American Statistical Association, vol.96, issue.454, pp.746-774, 2001.

S. O. Kuznetsov and M. Tatiana, On interestingness measures of formal concepts, Information Sciences, vol.442, issue.443, pp.202-219, 2018.

J. Li, H. Li, L. Wong, J. Pei, and G. Dong, Minimum description length principle: Generators are preferable to closed patterns, AAAI. pp, pp.409-414, 2006.

P. Miettinen and J. Vreeken, Model order selection for boolean matrix factorization, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.51-59, 2011.

P. Miettinen and J. Vreeken, Mdl4bmf: Minimum description length for boolean matrix factorization, ACM Transactions on Knowledge Discovery from Data (TKDD), vol.8, issue.4, p.18, 2014.

A. Siebes, Mdl in pattern mining a brief introduction to krimp, Formal Concept Analysis, pp.37-43, 2014.

J. Vreeken, M. Van-leeuwen, and A. Siebes, Krimp: mining itemsets that compress, Data Mining and Knowledge Discovery, vol.23, issue.1, pp.169-214, 2011.

M. Yurov, D. I. Ignatov, L. Polkowski, Y. Yao, P. Artiemjew et al., Turning krimp into a triclustering technique on sets of attribute-condition pairs that compress, pp.558-569