M. Atzmueller and F. Puppe, SD-Map -a fast algorithm for exhaustive subgroup discovery, Proceedings PKDD, pp.6-17, 2006.

Y. Aumann and Y. Lindell, A statistical theory for quantitative association rules, Proceedings ACM SIGKDD, pp.261-270, 1999.

A. Belfodil, A. Belfodil, and M. Kaytoue, Anytime subgroup discovery in numerical domains with guarantees, Proceedings ECML/PKDD, pp.500-516, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02117627

M. Boley and H. Grosskreutz, Non-redundant subgroup discovery using a closure system, Proceedings ECML/PKDD (1), pp.179-194, 2009.

G. Bosc, J. F. Boulicaut, C. Raïssi, and M. Kaytoue, Anytime discovery of a diverse set of patterns with monte carlo tree search, Data Min. Knowl. Discov, vol.32, pp.604-650, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01418663

U. M. Fayyad and K. B. Irani, Multi-interval discretization of continuous-valued attributes for classification learning, Proceedings IJCAI, pp.1022-1029, 1993.

B. Ganter, R. Wille, and R. Wille, Formal Concept Analysis: Mathematical Foundations, 1998.

S. Garcia, J. Luengo, J. A. Saez, V. Lopez, and F. Herrera, A survey of discretization techniques: Taxonomy and empirical analysis in supervised learning, IEEE Trans. on Knowl. and Data Eng, vol.25, issue.4, pp.734-750, 2013.

G. C. Garriga, P. Kralj, and N. Lavra?, Closed sets for labeled data, J. Mach. Learn. Res, vol.9, pp.559-580, 2008.

H. Grosskreutz and D. Paurat, Fast and memory-efficient discovery of the top-k relevant subgroups in a reduced candidate space, Proceedings ECML/PKDD (1), pp.533-548, 2011.

H. Grosskreutz and S. Rüping, On subgroup discovery in numerical domains, Data Min. Knowl. Discov, vol.19, issue.2, pp.210-226, 2009.

H. Grosskreutz, S. Rüping, and S. Wrobel, Tight optimistic estimates for fast subgroup discovery, Proceedings ECML/PKDD (1), pp.440-456, 2008.

M. Kaytoue, S. O. Kuznetsov, and A. Napoli, Revisiting numerical pattern mining with formal concept analysis, Proceedings IJCAI, pp.1342-1347, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00600222

W. Klösgen, Explora: A multipattern and multistrategy discovery assistant, Advances in Knowledge Discovery and Data Mining, pp.249-271, 1996.

F. Lemmerich, M. Atzmueller, and F. Puppe, Fast exhaustive subgroup discovery with numerical target concepts, Data Min. Knowl. Discov, vol.30, issue.3, pp.711-762, 2016.

M. Mampaey, S. Nijssen, A. Feelders, and A. Knobbe, Efficient algorithms for finding richer subgroup descriptions in numeric and nominal data, Proceedings IEEE ICDM, pp.499-508, 2012.

A. Millot, R. Cazabet, and J. F. Boulicaut, Actionable subgroup discovery and urban farm optimization, Proceedings IDA (2020), 12 pages
URL : https://hal.archives-ouvertes.fr/hal-02483314

K. Moreland and K. Truemper, Discretization of target attributes for subgroup discovery, Proceedings MLDM, pp.44-52, 2009.

H. V. Nguyen and J. Vreeken, Flexibly mining better subgroups, Proceedings SIAM SDM, pp.585-593, 2016.

A. Soulet, B. Crémilleux, and F. Rioult, Condensed representation of emerging patterns, Proceedings PAKDD, pp.127-132, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00324836

G. I. Webb, Discovering associations with numeric variables, Proceedings ACM SIGKDD, pp.383-388, 2001.

S. Wrobel, An algorithm for multi-relational discovery of subgroups, Proceedings PKDD, pp.78-87, 1997.