Evaluation measures for multi-class subgroup discovery, ECML PKDD, pp.35-50, 2009. ,
Sd-map-a fast algorithm for exhaustive subgroup discovery, pp.6-17, 2006. ,
Direct local pattern sampling by efficient two-step random procedures, pp.582-590, 2011. ,
Linear space direct pattern sampling using coupling from the past, pp.69-77, 2012. ,
Anytime discovery of a diverse set of patterns with monte carlo tree search, DMKD, vol.32, issue.3, pp.604-650, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01418663
Fast generation of best interval patterns for nonmonotonic constraints, ECML PKDD, pp.157-172, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01186718
Revisiting pattern structure projections, Formal Concept Analysis, pp.200-215, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01186719
Galois connections and complete sublattices, Galois Connections and Applications, pp.211-229, 2004. ,
Multi-interval discretization of continuous-valued attributes for classification learning, pp.1022-1029, 1993. ,
Formal Concept Analysis, 1999. ,
, Pattern structures and their projections, pp.129-142, 2120.
Closed sets for labeled data, Journal of Machine Learning Research, vol.9, pp.559-580, 2008. ,
Interestingness measures for data mining: A survey, ACM Comput. Surv, vol.38, issue.3, 2006. ,
Dense neighborhood pattern sampling in numerical data, SIAM. pp, pp.756-764, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01889220
On subgroup discovery in numerical domains, Data Min. Knowl. Discov, vol.19, issue.2, pp.210-226, 2009. ,
Mining relevant interval rules, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01584981
Alpine: Progressive itemset mining with definite guarantees, SIAM. pp, pp.63-71, 2017. ,
Comparing images using the hausdorff distance, IEEE Trans. Pat. Anal. Mach. Intell, vol.15, issue.9, pp.850-863, 1993. ,
Revisiting Numerical Pattern Mining with Formal Concept Analysis, pp.1342-1347, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00600222
Mining gene expression data with pattern structures in fca, Inf. Sci, vol.181, issue.10, 1989. ,
Discretization algorithm that uses class-attribute interdependence maximization, pp.980-987, 2001. ,
Diverse subgroup set discovery, Data Min. Knowl. Discov, vol.25, issue.2, pp.208-242, 2012. ,
On selecting interestingness measures for association rules: User oriented description and multiple criteria decision aid, European Journal of Operational Research, vol.184, issue.2, pp.610-626, 2008. ,
A new evolutionary algorithm for mining top-k discriminative patterns in high dimensional data, Appl. Soft Comput, vol.59, pp.487-499, 2017. ,
Efficient algorithms for finding richer subgroup descriptions in numeric and nominal data, ICDM. pp, pp.499-508, 2012. ,
DOI : 10.1109/icdm.2012.117
Traversing itemset lattice with statistical metric pruning, ACM SIGMOD-SIGACT-SIGART, pp.226-236, 2000. ,
DOI : 10.1145/335168.335226
Rough sets, International Journal of Parallel Programming, vol.11, issue.5, pp.341-356, 1982. ,
Lattices and Ordered Sets, 2008. ,
An algorithm for multi-relational discovery of subgroups, PKDD. pp, pp.78-87, 1997. ,
DOI : 10.1007/3-540-63223-9_108
Discretization methods, Data Mining and Knowledge Discovery Handbook, pp.101-116, 2010. ,
Using anytime algorithms in intelligent systems, AI Magazine, vol.17, issue.3, pp.73-83, 1996. ,