Mining association rules between sets of items in large databases, ACM SIGMOD, pp.207-216, 1993. ,
Sd-map -A fast algorithm for exhaustive subgroup discovery, PKDD 2006, pp.6-17, 2006. ,
Flash points: Discovering exceptional pairwise behaviors in vote or rating data, ECML/PKDD, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01587041
Anytime subgroup discovery in numerical domains with guarantees, ECML/PKDD, vol.11052, pp.500-516, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02117627
A framework for mining interesting pattern sets, SIGKDD Explorations, vol.12, issue.2, pp.92-100, 2010. ,
Direct local pattern sampling by efficient two-step random procedures, KDD, pp.582-590, 2011. ,
Anytime discovery of a diverse set of patterns with monte carlo tree search, Data Min. Knowl. Discov, vol.32, issue.3, pp.604-650, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01418663
The chosen few: On identifying valuable patterns, ICDM, pp.63-72, 2007. ,
The CN2 induction algorithm, Machine Learning, vol.3, pp.261-283, 1989. ,
Efficient mining of emerging patterns: Discovering trends and differences, KDD, pp.43-52, 1999. ,
From data mining to knowledge discovery in databases, AI Magazine, vol.17, issue.3, pp.37-54, 1996. ,
ROC 'n' rule learning -towards a better understanding of covering algorithms, Machine Learning, vol.58, pp.39-77, 2005. ,
Formal Concept Analysis, 1999. ,
Pattern structures and their projections, ICCS, pp.129-142, 2001. ,
Closed sets for labeled data, PKDD, pp.163-174, 2006. ,
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. ,
Class relevant pattern mining in output-polynomial time, SDM, pp.284-294, 2012. ,
Tight optimistic estimates for fast subgroup discovery, ECML/PKDD, pp.440-456, 2008. ,
Evaluating pattern set mining strategies in a constraint programming framework, PAKDD, pp.382-394, 2011. ,
, Siegfried Nijssen, and Luc De Raedt. k-pattern set mining under constraints, Tias Guns, pp.402-418, 2013.
Interestingness measures for fixed consequent rules, IDEAL, pp.68-75, 2012. ,
On trading off consistency and coverage in inductive rule learning, LWA, vol.1, 2006. ,
, of Hildesheimer Informatik-Berichte, pp.306-313, 2006.
Mining the most interesting rules, KDD, pp.145-154, 1999. ,
Revisiting Numerical Pattern Mining with Formal Concept Analysis, IJCAI, pp.1342-1347, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00600222
Constraint programming for mining n-ary patterns, CP 2010, pp.552-567, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-01016652
Explora: A multipattern and multistrategy discovery assistant, Advances in Knowledge Discovery and Data Mining, pp.249-271, 1996. ,
, Pattern teams. In PKDD, pp.577-584, 2006.
Learning of simple conceptual graphs from positive and negative examples, PKDD, pp.384-391, 1999. ,
Rule evaluation measures: A unifying view, ILP, vol.1634, pp.174-185, 1999. ,
, Subgroup discovery with CN2-SD. JMLR, pp.153-188, 2004.
Fast discovery of relevant subgroup patterns, FLAIRS, 2010. ,
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. ,
URL : https://hal.archives-ouvertes.fr/hal-02316548
Efficient algorithms for finding richer subgroup descriptions in numeric and nominal data, ICDM, pp.499-508, 2012. ,
The pattern ordering problem, PKDD 2003, pp.327-338, 2003. ,
An analysis of approximations for maximizing submodular set functions -I, Math. Program, vol.14, issue.1, pp.265-294, 1978. ,
Evaluation of rule interestingness measures with a clinical dataset on hepatitis, PKDD, vol.3202, pp.362-373, 2004. ,
Integer linear programming for pattern set mining; with an application to tiling, PAKDD 2017, pp.286-299, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01597819
Discovery, analysis, and presentation of strong rules, Knowledge Discovery in Databases, pp.229-248, 1991. ,
Constraint-based pattern set mining, SDM, pp.237-248, 2007. ,
Misosoup: Mining interesting subgroups with sampling and pseudodimension, KDD, pp.2130-2139, 2018. ,
Lattices and Ordered Sets, 2008. ,
Data science as a language: challenges for computer science -a position paper, I. J. Data Science and Analytics, vol.6, issue.3, pp.177-187, 2018. ,
Item sets that compress, SDM, pp.395-406, 2006. ,
Selecting the right interestingness measure for association patterns, SIGKDD 2002, pp.32-41, 2002. ,
Predictive performance of weighted relative accuracy, PKDD, pp.255-264, 2000. ,
Exploratory data analysis. Addison-Wesley series in behavioral science : quantitative methods, 1977. ,
Diverse subgroup set discovery, Data Min. Knowl. Discov, vol.25, issue.2, pp.208-242, 2012. ,
OPUS: an efficient admissible algorithm for unordered search, J. Artif. Intell. Res, vol.3, pp.431-465, 1995. ,
An algorithm for multi-relational discovery of subgroups, PKDD, pp.78-87, 1997. ,
APPENDIX A. Problem III-C is NP-Hard. Before giving the demonstration, let us consider a reformulation of Problem III-C presented below in Problem A. Problem Statement (Problem A), PAKDD, volume 1805 of Lecture Notes in Computer Science, pp.245-256, 2000. ,